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?
Answer: A. K, J, I, H, G, F, E, D, C, B, A
- 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 444 students.
Show answer & explanation
Correct answer: A
Loading lesson…