Vidyalelo
Data Structure · Q10

Binary Search Trees(B Tree)

Programming · Data Structure · question 10

Q10

In a BST, how do you find the minimum value node?

A.
Traverse to the leftmost node from the root.
Answer
B.
Traverse to the rightmost node from the root.
C.
Find the node with the maximum value.
D.
Find the node with the second highest value.

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board