Although the distinguished ancestor may be log2n levels high in the tree, the average distance is 2. (It's at least 1, and half of the time we recurse, so , meaning that .)
Like binomial heaps, the fundamental operation on weak heaps is merging two heaps of equal height , to make a weak heap of height .