Binary Tree Traversals – Quiz

1. 1. What is the Inorder (DFS) visiting order?

   Root, Left, RightLeft, Right, RootLeft, Root, RightRight, Root, Left

2. 2. For a Binary Search Tree (BST), which traversal prints keys in ascending order?

   PreorderInorderPostorderLevel-order (BFS)

3. 3. Which traversal uses a queue by default?

   PreorderInorderPostorderLevel-order (BFS)

4. 4. Which traversal visits the root node last?

   PreorderInorderPostorderLevel-order (BFS)

5. 5. Given this tree: Root=A; children: B (left), C (right); B's children: D (left), E (right); C's children: F (left), G (right). What is the Preorder?

   A, B, D, E, C, F, GD, B, E, A, F, C, GD, E, B, F, G, C, AA, D, B, E, C, F, G

6. 6. Which traversal is most suitable for safely freeing/deleting all nodes (post-order resource cleanup)?

   PreorderInorderPostorderLevel-order (BFS)