A binary search tree by keys and a heap by random priorities at the same time. Rotations restore the heap order, and random priorities keep the tree shallow.
This interactive visualization needs JavaScript.