Question 6
· unclassifiedP · Verified PYQ
Problem
Construct the inorder traversal for the constructed tree with
Below preorder and postorder traversals Preorder: 12 4 3 2 4 11 15 13 14 16 Postorder: 2 3 11 4 4 14 13 16 15 12
- A. 2 3 4 4 11 12 13 14 15 16
- B. 2 3 4 11 12 13 4 14 15 16
- C. 11 12 13 2 3 4 4 14 15 16
- D. 11 12 13 14 15 16 2 3 4 4