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