A set of nodes T is a binary search tree ____. A) if T is not empty, its root node has two subtrees, T_L and T_R, such that T_L and T_R are binary search trees and the value in the root node of T is greater than all values in T_L and is less than all values in T_R. B) if T is not empty, its root node has two subtrees, T_L and T_R, such that T_L and T_R are binary trees. C) if T is empty and its height is 0 D) if T is not empty, its height height is the maximum depth of its nodes.

Question

Quizplus · Accepted Answer

A binary search tree requires that for each node, all values in the left subtree are less than the node's value, and all values in the right subtree are greater.

A Set of Nodes T Is a Binary Search Tree