NIELIT 2021 Dec Scientist A - Section B: 47

Question

Suppose a binary search tree has been constructed from the following sequence of numbers in the order in which they arrive : $6, 2, 10, 1, 5, 7, 11, 3, 9, 4, 8.$ Consider the following piece of code :

Show(root) $ \{ \text { if (root != NULL)}$

$\qquad \quad \{ \text{printf}( “ \% d”, \text{root} \rightarrow \text{key)};$

$\qquad \qquad$ show $\text{(root} \rightarrow \text{right)};$

$\qquad \qquad$ show $\text{(root} \rightarrow \text{left)};$

$\qquad \qquad$ }

$\qquad \quad$ else

return ;

$\qquad$ }

The sequence printed will be :

• A. $6, 11, 10, 7, 8, 9, 2, 4, 3, 5, 1$
• B. $6, 11, 7, 9, 8, 10, 2, 5, 1, 3, 4$
• C. $6, 10, 11, 7, 9, 8, 2, 5, 3, 4, 1$
• D. $6, 10, 2, 11, 7, 9, 8, 5, 3, 4, 1$

Answer 1

​​​​

TRAVERSAL : 6 10 11 7 9 8 2 5 4 3 1

Answer 2

answer is C

first construct tree and then apply this code