priority queues (heaps figure result of merging with ' right subheap figure result of merging skew heaps and the exception of the last after few examplesit becomes clear that since all but the last node on the right path have their children swappedthe net effect is that this becomes the new left path (see the preceding example to convince yourselfthis makes it very easy to merge two skew heaps visually this is not exactly the same as the recursive implementation (but yields the same time boundsif we only swap children for nodes on the right path that are above the point where the merging of right paths terminated due to exhaustion of one heap' right pathwe get the same result as the recursive version