DataStructures / Data structures Interview questions
What is binary search tree?
Binary Search Tree has some special properties such as left nodes contains items whose value is less than root, right sub tree contains keys with higher node value than root, and there will not be any duplicates in the tree.
Binary Search Tree is also known as ordered or sorted binary trees.
More Related questions...