These properties make it simple to move the cursor around the tree and to get values. That is, we've given an implementation of an implementation of a data structure. We can use the heap structure to provide a fairly simple and quick sorting algorithm. There are n insertions. You'll need to think about it.
Most people implement heap sort with array-based heaps.
Some even define heap sort completely in terms of the array operations, and forget the origins. Here's the core of heap sort. Back to Implementing Stacks and Queues . On to Automated Problem Solving with Linear Structures . Any or all of the information on the pages may be incorrect.