To find the minimum node in a binary search tree
A) you should start at the root,and then keep passing from each node to its left child until you come to a node with no left child
B) you should start at the root,and then keep passing from each node to its right child until you come to a node with no right child
C) you should look at the root of the binary tree
D) you need to examine every node,and then pick the one with the least value

Question

Quizplus · Accepted Answer

In a binary search tree, the minimum value will always be the leftmost node. Therefore, starting at the root and then passing to each left child until you reach a node with no left child will give you the minimum node.

To Find the Minimum Node in a Binary Search Tree