Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

ISRO | ISRO CS 2014 | Question 41

  • Last Updated : 16 Apr, 2018

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

Answer: (C)

Explanation: In a BST, value (left node) < value(root) < value(right node) We can consider an example to find out the 4th smallest element:

From the above BST, we can clearly see that 8 is the fourth smallest element.
So, option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!