next up previous
Next: Exercise 7.1-2 Up: CSE 2320: Algorithms and Previous: Heapsort

Running Times

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 .

Operations on heap proportional to height.



Copyright © 1998 The University of Texas at Arlington