Lecture 3: Binary search trees: Splay trees, bounds, dynamic optimality conjecture
These are rough, personal lecture notes handwritten by Erik Demaine used during lecture. Their primary purpose is for reading/review by students of the class. They supplement scribe notes prepared by students. Accessibility
<< prev lecture << -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]