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) the root's left child value 45 B) some values will be 45 C) approximately half the values are 45 D) all will be

Question

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) the root's left child value < 45, but the right child of the root's left child value is > 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) all will be < 45

Quizplus · Accepted Answer

In a binary search tree, all values in the left subtree of a node are less than the node's value. Therefore, all descendants in the left subtree of the root with value 45 will have values less than 45.

In a Binary Search Tree, Where the Root Node Data