Treap (Randomized Binary Search Tree) Interactive Visualizer
A Treap combines a BST key with a random heap priority so split and merge run in O(log n) expected time—unlocking implicit-key range reversals, splits, and order statistics in ~30 lines of code.
Study Treap (Randomized Binary Search Tree) Explanation · View Multi-Language Code · All Algorithms