S11 (photon mapper, maybe) Asg 01—binary heap Asg 02—stack; infix/postfix Asg 03—AVL trees Asg 04—Dijkstra's/Prim's algorithms Asg 05—kd-tree Asg 06—TBD Lab 01—templated array Lab 02—Timer class, bubble sort Lab 03—binary heap Lab 04—linked list iterator Lab 05—algorithm analysis I Lab 06—algorithm analysis II Lab 07—sorting & median Lab 08—binary search trees I Lab 09—binary search trees II Lab 10—shortest path (Dijkstra) Lab 11—depth-first search Lab 12—TBD F10 (ray traced leaves, trees, etc.) Lab 02—Timer class, bubble sort Lab 03—C-style file I/O Lab 04—templated priority queue Lab 05—selection sort on linked list Lab 06—finding the median Lab 07—parsing .obj files Lab 08—binary search trees Lab 09—elementary kd-tree Lab 10—more common kd-tree Lab 12—AVL tree Lab 13—red/black tree F09 (basic textbook approach) F06 (Hughes Hoppe's isosurface) Lab 01—binary search trees I Lab 02—binary search trees II Lab 03—templates & matrices Lab 04—sorting & median Lab 05—algorithm analysis I Lab 06—algorithm analysis II Lab 07—linked list iterator Lab 08—binary heap Lab 09—shortest path (Dijkstra) Lab 10—depth-first search Lab 11—disjoint sets (maze) Lab 12—edge detection