UGC NET CSE | June 2012 | Part 2 | Question: 8

Question

A binary search tree is a binary tree in which

• A. All items in the left subtree are less than root
• B. All items in the right subtree are greater than or equal to root
• C. Each subtree is itself a binary search tree
• D. All of the above

Answer 1

clearly D all are true no explanation is needed i think