A binary search tree is a binary tree :
UGC NET - 2012,
Answer: D
All three statements describe a binary search tree, so the answer is All of the above.
In a binary search tree every item in the left subtree is less than the root, every item in the right subtree is greater than or equal to the root, and each subtree is itself a binary search tree, which is the recursive definition. Because (A), (B) and (C) are all parts of the definition, choosing any one of them is incomplete.
Please log in or register to report this question.