In a Binary Search Tree, Where the Root Node Data

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

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