CMSC-341, Spring 1999, Sections 101 and 201
Lecture Synopsis
10. Improving Performance of Lists
[Previous Lecture]
[Next Lecture]
- Lists vs. Binary Search Trees
- Worst case scenario for BST is equivalent to a list
- Definitions
- External vertex
- Internal vertex
- Path
- Path length
- Internal path length
- External path length
- Augmented binary tree
- Average case behavior of Randomly Constructed Binary Search Trees
- Improving Performance of Lists
- Binary Search
- Self-Organizing Lists
- Move-to-front
- Transpose
- Frequency count
- Skip Lists
[Previous Lecture]
[Next Lecture]
Last modified on
Monday March 15, 1999 (13:58:06 EST)
by
Alan Baumgarten
email: abaumg1@cs.umbc.edu
Back up
to Spring 1999 CMSC-341 Section 1 and 2 Homepage