Binary Search Tree is a

1.5 Binary Search Tree is a
A) tree whose right and left sub-tree has value less than root.
B) tree whose right and left sub-tree has value more than root.
C) tree whose left sub-tree has value less than root and right sub-tree has value more than
root.
D) none of the above.

Leave a Reply