Vidyalelo
Data Structure · Q38

Binary Search Trees(B Tree)

Programming · Data Structure · question 38

Q38

In a BST, how do you identify the maximum value node?

A.
By traversing to the rightmost node from the root.
Answer
B.
By traversing to the leftmost node from the root.
C.
By finding the root node.
D.
By searching the entire tree.

Answer: Option A

Solution

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