Balanced Tree Implementation Techniques: Rotating Treap and FHQ Treap Practice
Got thoroughly disgusted by the rotating Treap, never writing it again!
FHQ Treap is far more pleasant — half the code length of its rotating counterpart.
Rotating Treap
Structure and data definitions
const long long INF = 1e18;
struct RotNode {
int left, right;
long long key;
unsigned priority;
int cnt, size;
} nodePool[M + N]; ...
Posted on Sun, 10 May 2026 18:15:42 +0000 by spaceknop