Today we will see a way to approximately balance a binary search tree using Treaps, or a tree of heaps.