Values are commonly stored in a binary search tree so that a node's _ child holds data that is less than the _ _ data, while the node's data is less than the data in the other child.
A)right, node's
B)right, left child's
C)left, node's
D)left, right child's
E)None of the above

Question

Quizplus · Accepted Answer

In a binary search tree, the left child of a node contains values less than the node's value, and the node's value is less than the values in the right child.

Values Are Commonly Stored in a Binary Search Tree So