Summary

Combines binary-search ordering with random heap priorities.

How it Works

• Assign each inserted key a random priority.

• Rotate tree nodes to maintain the heap property.

• Traverse keys in order.