Consider the following binary search tree T given below:
Which node contains the fourth smallest element in T?
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