Data Structures Treaps:BST Order Plus Heap Priority A treap is a BST on keys and a heap on random priorities. Rotations restore heap order so the shape stays balanced in expectation without color bits. Read More →