Binary search tree

Binary search tree (BST) is a data structure that allows fast element lookup, addition or removal of items.