26. Programming Abstractions Lecture 26

Published: July 23, 2008, 7:17 p.m.

Julie ties up the "loose ends" of the course: after a general review of the concepts covered in the course, she asks which of two examples is the better. She then covers manipulation of dynamic data structures (lists, trees, graphs).