A leftist heap without the bookkeeping: merge along the right paths and swap the children of every node on the way, always. O(log n) amortized.
This interactive visualization needs JavaScript.