The leftmost node in a binary search tree will contain the __________ element, while the rightmost node will contain the __________ element.
A) Maximum, minimum
B) Minimum, maximum
C) Minimum, middle
D) None of the above

Question

Quizplus · Accepted Answer

In a binary search tree, the leftmost node represents the smallest (minimum) element because all elements to the left of a node are smaller than the node itself. Conversely, the rightmost node represents the largest (maximum) element because all elements to the right of a node are larger than the node itself.

The Leftmost Node in a Binary Search Tree Will Contain