Running times depend on height of the tree -- the height of a node in a tree is the number of edges in the longest simple path from the node to a leaf.

The height of the tree is the ? height of the root node .

Operations on heap proportional to height.