Lecture 6 - CS409

More Balanced Trees, Choosing a Dictionary, Priority Queues

2/11/99


Click here to start


Table of Contents

A More Careful 234-Tree Analysis

234-Tree Implementation

Using BSTs to Emulate 234-Trees

Red-Black Trees

Skip Lists

Balanced Tree Schemes

Selecting a Dictionary Scheme

ADT Priority Queue

Possible PQ Implementations

Heaps

Insert and GetMax

Heap Implementation (the Big Trick)

 Author: Paul Chew

Home Page: http://www.cs.cornell.edu/cs409-sp99/