Conceptual overview of Binary Search Trees
A Binary Search Tree (BST for short) is a data structure in which everyone to the left of the current node has a smaller value, and everyone to the right has a larger value. If they can be guaranteed to be balanced (which is junior level data structures), then they have O(logN) insert, search, and delete operations, and never need to be sorted, since they're always sorted.