Consider the following New-order strategy for traversing a binary tree. I.…

DSSSB TGT/PGT · 2021 · TGT Computer Science · post code 91/20 · 2021 paper 1 · Section B: subject

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?

1. A.

   K, J, I, H, G, F, E, D, C, B, A

2. B.

   A, B, C, D, E, F, G, H, I, J, K

3. C.

   B, D, C, A, G, F, H, E, I, J, K

4. D.

   A, B, C, D, K, J, I, H, G, F, E

Attempted by 577 students.