01 1-1-arrays (28.08 MB)
02 1-2-linked-memory (23.47 MB)
03 1-3-run-time-analysis (26.22 MB)
04 1-4-array-and-list-operations (20.61 MB)
05 1-5-queue-data-structure (17.42 MB)
06 1-6-stack-data-structure (16.08 MB)
01 2-1-tree-terminology (15.86 MB)
02 2-2-binary-trees (17.7 MB)
03 2-3-tree-traversals (34.84 MB)
04 2-4-binary-search-trees (31.1 MB)
05 2-5-bst-analysis (14.81 MB)
01 3-1-1-balanced-bst (16.7 MB)
02 3-1-2-avl-analysis (14.78 MB)
01 3-2-1-b-tree-introduction (15.9 MB)
02 3-2-2-b-tree-insert (25.72 MB)
03 3-2-3-b-tree-search (15.92 MB)
01 4-1-heap-introduction (53.79 MB)
02 4-2-heap-insert (31.67 MB)
03 4-3-heap-removemin (24.71 MB)
04 4-4-heap-buildheap (34.31 MB)
05 4-5-heap-runtime-analysis (24.5 MB)