The leftmost node in a binary search tree will contain the minimum element, while the rightmost node will contain the maximum element.

Question

Quizplus · Accepted Answer

In a binary search tree (BST), the left child of a node always contains a value less than its parent node, and the right child contains a value greater. Therefore, by traversing to the leftmost node, you reach the minimum element, and by traversing to the rightmost node, you reach the maximum element.

The Leftmost Node in a Binary Search Tree Will Contain