Binary search trees

A binary search tree stores and sorts information in a tree-based hierarchy. As discussed in Big O Notation, algorithms provide the best efficiency with sorted data. Binary Search Tree (BST) models are built using specific rules.  They should not be mistaken for a binary tree or trie. Those structures also store information in a hierarchy, but employ different rules.