Fundamentals of Computer Science II (CSC-152 99S)


Class 46: Heaps and Heap Sort

Back to Introduction to Trees. On to Lab: Traversing and Iterating Trees.

Held Tuesday, April 27

Summary

Contents


Notes


Some Tree Terminology

Implementing Binary Trees with Arrays

Heaps

Modifying Heaps

Adding an Element

Deleting an Element

Heap Sort


History


Back to Introduction to Trees. On to Lab: Traversing and Iterating Trees.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS152/99S/Outlines/outline.46.html

Source text last modified Tue Apr 27 09:59:43 1999.

This page generated on Tue Apr 27 10:09:45 1999 by SiteWeaver. Validate this page's HTML.

Contact our webmaster at rebelsky@math.grin.edu