> See also: > - Reference # Treaps ![[Pasted image 20240305161735.png|400]] Treap deletion operations are somewhat unique. Instead of using the successor/predecessor rule, we set the priority number of the deleted node to $-\infty$ (or $\infty$ for min heaps) and rotate it down until it is a leaf node.