##### Treap: Using randomization to balance binary search trees

. . . between a tree and a heap! Treap is just the portmanteau of tree and heap. Binary search trees, in fact, offer the best average performance across all standard operations: insert, remove, and search (and also min and max). Heaps, on the other hand, allow us to efficiently keep track of priorities using a tree-like [ ...] [ ...]