Implement a treap (randomized balanced BST) as an ordered multiset in Python. treap.py: split/merge based…
Implement a treap (randomized balanced BST) as an ordered multiset in Python. treap.py: split/merge based…: a task in traj2envs-rl: RL tasks generated with traj2envs (Harbor dataset). t = Treap(seed=None) seed: int None; per-instance RNG random.Random(seed) len(t) - int, number of stored values…
The task
t = Treap(seed=None) # seed: int | None; per-instance RNG random.Random(seed) len(t) # -> int, number of stored values (duplicates counted) t.insert(x) # -> None; inserts one occurrence of x t.erase_one(x) # -> bool; removes exactly ONE occurrence of x; True iff x was present t.count_less(x) # -> int; number of…
Part of harness-hub/traj2envs-rl.