Consider the following New-order strategy for traversing a binary tree. I.…
2021
Consider the following New-order strategy for traversing a binary tree.
I. Visit the right subtree of node using new-order
II. Visit the left subtree of node using new-order
III. Visit the node. What is the new-order traversal of the given tree?
- A.
K, J, I, H, G, F, E, D, C, B, A
- B.
A, B, C, D, E, F, G, H, I, J, K
- C.
B, D, C, A, G, F, H, E, I, J, K
- D.
A, B, C, D, K, J, I, H, G, F, E
Attempted by 160 students.
Show answer & explanation
Correct answer: A
The "New-order" traversal follows the rule: Visit Right Subtree -> Visit Left Subtree -> Visit Node.
1. Start at Root A.
2. Traverse Right Subtree (Rooted at E):
- Visit Right Child I: Its right child is J, and J's right child is K. Traversing this branch yields: K, J, I.
- Visit Left Child F: It has Right child H and Left child G. Traversing yields: H, G, F.
- Visit E. Subtree Result: K, J, I, H, G, F, E.
3. Traverse Left Subtree (Rooted at B):
- Visit Right Child C: It has Left child D. Traversing yields: D, C.
- Visit B. Subtree Result: D, C, B.
4. Visit Root A.
Final Sequence: K, J, I, H, G, F, E, D, C, B, A.