Vidyalelo
Data Structure · Q29

Binary Search Trees(B Tree)

Programming · Data Structure · question 29

Q29

How do you find the predecessor of a node in a Binary Search Tree (BST)?

A.
The largest node in the left subtree.
Answer
B.
The smallest node in the right subtree.
C.
The smallest node in the left subtree.
D.
The largest node in the right subtree.

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Binary Search Trees(B Tree) questions