In a Binary Search Tree, Where the Root Node Data

Multiple Choice

In a binary search tree, where the root node data value = 45, what do we know about the data values of all the descendants in the left subtree of the root?

A) all will be < 45
B) some values will be < 45, but there may be a few values > 45
C) approximately half the values are < 45, the other half are > 45
D) the root's left child value < 45, but the right child of the root's left child value is > 45