Lecture Notes: Data Structures CSC 172 (Fall 1998)
What This Course Is About
The List Data Type
Overheads for simple math.
Some overheads about trees.
Balanced Trees
Dynamic Programming and Longest Common Subsequence
Complete Set of Ullman's Stanford Lecture Notes
Text Errata
Readings
Tutorials
This page is maintained by
Last update: 18.8.98.