ICS 165 notes
Big arrays in C procedures
Coding standards
Documentation standards
Handling interrupts in C
Memory allocation
Make: a Unix programming aid
Testing and verification
Timing
Dynamic binary search trees
- AVL and splay trees
Optimal binary search trees
Dan Hirschberg
Computer Science Department
University of California, Irvine, CA 92697-3435
dan (at) ics.uci.edu
Last modified: Apr 13, 2005