To Find the Minimum Node in a Binary Search Tree

question 37

Multiple Choice

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