Data Structures & Algorithms Lecture Notes

3 December 2009 • Heaps and Priority Queues


Outline

Array-Based Trees

Storing Trees In Arrays

Binary Tree Indexing

Heaps

Heap Characteristics

Heap ADT

Other Heap Operations

Heap ADT Implementation

Heap Add

Example Heap Add

Heap Remove

Example Heap Remove

Priority Queues

Heaps as Priority Queues

Sorting Again

Sorting With A Heap

Heapsort

heapsort(a[], n)

  for i = 1 to n - 1
    bubble-up(a, i)

  for i = n - 1 to 1
    swap(a[0], a[i])
    bubble-down(i)

Are They?

heapsort vs quicksort on ints

heapsort vs quicksort on points

Summary

References


This page last modified on 7 December 2009.

Creative
    Commons License