CSE 326 - Lectures

Lectures

Title	Applets/Extras
Introduction and Overview
Stacks, Queues, and Lists	Circular array queue
Asymptotics
Binary Heaps	Binary heap Max Heap ("Heap" tab)
Binary Heaps	Binary heap Max Heap ("Heap" tab)
Leftist and Skew heaps	Skew heap, Leftist heap
Binomial queues	Binomial queue (heap)
Binary search trees	Binary search trees ("BST" tab)
AVL trees	AVL trees ("AVL tree" tab)
Splay trees	Splay trees ("Splay tree" tab) Note: their "insert" is different from lecture!
K-D trees
Midterm Review
B-trees and B+ trees	3-4-5 B-trees ("B-tree" tab) Note: not a B+ tree.
Hash tables	Hash tables
Midterm Post-mortem
Disjoint Sets Union/Find
Disjoint Sets, Sorting Intro
Divide & Conquer Sorting	Sorting visualizations (choose algorithm, click on image) More sorting demos (launches separate applet window)
Sorting
Graphs
Graphs and Traversals
Dijkstra's Algorithm
End of Graph Search
Network Flow
Minimum Spanning Trees
Final Review
Good News, Bad News

Title	Applets/Extras
Java Generics and JUnit	MyArrayList.java MyArrayListTest.java