Final Exam Coverage

(page numbers refer to the Baden/DeWitt notes):

pages....topic
--------------
5-6......"what's in a const"
15-18....arrays, plus triangular and packed arrays in supplementary handout
18-21....order notation
21-26....stacks
27-47....lists and queues
47-54....trees, array representations
55-60....binary search trees
61-64....threaded BST's
66-77....heaps and heap sort
78-88....2-3 trees
89-90....B trees
91-92....leftist heaps
93-103...hashing, plus supplementary handout on Ordered and Brent's Hashing
105-116..graphs, plus supplementary handout on Disjoint Subsets
117-128..dynamic memory management