EECS 560 - Data Structures Labs
- Lab 01 - Singly linked list
- Lab 02 - Binary tree
- Lab 03 - Hash table with open hashing
- Lab 04 - Hash table with chaining
- Lab 05 - Binary search tree
- Lab 06 - Time performance of open and closed hashing methods
- Lab 07 - Min 5-Heap
- Lab 08 - Binary minmax heap
- Lab 09 - Skew heap, leftist heap, and performance testing for both
- Lab 10 - Binomial Queue
- Lab 11 - Calculating minimum spanning trees from graphs