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.

- height(node 8) =
- height(node 3) = 1
- height(node 1) = 3

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

Operations on heap proportional to height.