Multiple ChoiceHard 30s
Treap
A treap combines a BST with a heap using:
Options
- 1Linked lists ordered by insertion sequence
- 2Random priorities to maintain balance
- 3Hash functions mapping keys to buckets
- 4Fixed insertion order without rebalancing
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.