what is Binary Search Tree (BST) in Data Structure?

binary search tree (BST):
a node-based data structure, which at most can have two child nodes counting from the left child. also known as Ordered or Sorted Binary Search Tree.

properties:

• each child must be either a leaf node or the root of another binary search sub tree.
• left sub-tree can contain only nodes, whom are less than the parent node.
• right sub-tree can contain only nodes, whom are greater than the parent node
• non of the nodes can be alike.

diagram:

specialties:

• basis for many of highly efficient sorting and searching algorithms
• can be used to construct abstract data structures including sets, multi-sets, associative arrays etc.