Match the descriptions to these traversals terms: Breadth-first traversal, Depth-first traversal, Preorder traversal, Inorder traversal.

TraversalsConcept relationships

Choose a match for every item. Use each answer once.

A breadth-first traversal uses a frontier commonly managed with a queue.

Preorder uses node-left-right order and encounters each parent before its descendants.

For a properly ordered binary search tree, inorder traversal yields sorted keys.

Depth-first traversal tracks pending branches using recursion or an explicit stack.