Binary search tree or BST is a family of tree-based data structures, with maximum of two children and which follow to the general restriction that any node in a tree is larger than all nodes in it’s left sub-tree and smaller than all nodes in it’s right sub-tree.

BST doesn’t support duplicates, thus it can be used to construct sets or associative arrays. Continue reading Binary search tree