Treap (Tree + Heap)

BST by key + Heap by random priority enabling clean `split` and `merge` in expected O(log n).

This lesson has not been built yet.