ISRO-DEC2017-51

Question

Suppose the numbers $7,5,1,8,3,6,0,9,4,2$ are inserted in that order into an initially empty binary search tree.The binary search tree uses the reversal ordering on natural numbers i.e. $9$ is assumed to be smallest and $0$ is assumed to be largest. The $in$-$order$ traversal of the resultant binary search tree is

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

Comments

Option (d)

Answer 1

The Inorder traversal of BST is always in ascending order. Here since 9 is smallest and 0 is largest Inorder traversal will be actually in descending order.

Ans- Option D