Preorder, Postorder and Inorder Traversal Quiz Online Practice Test

1. How does the time complexity of an iterative pre-order traversal compare in terms of efficiency?

2. In a recursive post-order traversal, how does the space complexity relate to the tree’s depth d and the total number of nodes n?

3. Which tree traversal method generates a prefix expression?

4. Given the following traversals for a binary tree—pre-order: A, B, E, C, D and in-order: B, E, A, D, C—what is the level-order traversal sequence?

5. Given the following sequences for a binary tree, identify which one represents the Preorder, Inorder, and Postorder traversals:

S1: N, M, P, O, Q

S2: N, P, Q, O, M

S3: M, N, O, P, Q

6. How many distinct binary trees can be formed using 3 nodes, if the nodes are visited in the post-order sequence N, M, L?

7. Given the post-order traversal of a binary tree as O P Q R S T, which of the following represents a possible pre-order traversal?

8. Given a binary search tree with the values 7, 8, 13, 26, 35, 40, 70, and 75, and a pre-order traversal sequence of 35, 13, 7, 8, 26, 70, 40, 75, which of the following represents a valid post-order traversal for the tree?

9. Which combination of traversal sequences is sufficient to uniquely reconstruct a binary tree?

10. Which traversal method is sufficient to generate a full binary tree?

11. For a recursive in-order traversal of a binary tree, what is the space complexity in terms of tree depth d and total nodes n?

12. How does the time complexity of a level-order traversal scale with the number of nodes N  in a binary tree?

13. Which graph traversal technique is most similar to the level-order traversal used in binary trees?

14. Which traversal approach on a binary search tree will output the nodes' values in ascending order?