ISRO2014-41

Question

Consider the following binary search tree T given below: Which node contains the fourth smallest element in T?

• A. Q
• B. V
• C. W
• D. X

Comments

Answer is option C i.e W ??

---

correct c

---

U is smallest then Q is second smallest

W is greater than Q and X is smaller then W so X is third smallest .

  W is forth smallest

Answer 1

Inorder traversal of BST sorts the elements in ascending order .

UQXWPVZY --> inorder traversal

4th smallest element is W.

Answer 2

The In-order traversal of BST gives number in sorted order

Here In-order traversal sequence is as follows

U Q X W P V Z Y

hence 4rth smallest will be W. 

Hence Option C) W will be the answer. 

Answer 3

Answer C) W

In BST left child is smaller than root value and right child is greater than root value.

Answer 4

1 st small = U

2 nd small = Q

3 rd small = X

4 th small = W  option A

Comments

Answer : Option C ===> W