AdvancedCS

All code from Advanced CS Class
Important Highlights:
Implementation of Stack and Queue classes as ADTs
Solving mazes by depth-first and breadth-first search (using own Stack and Queue)
Word Ladder solver by BFS
Implementation of singly Linked List class as an ADT
Radix sort by an array of (own) Linked Lists
Implementation of binary tree as an ADT supporting insertion, deletion, and in-order traversal
Implementation of Heap as an ADT
Huffman encoding/decoding
Solving “Einstein’s Riddle” by simulated annealing
Implementation of Unweighted and Weighted Graph classes as ADTs
Minimum spanning trees for unweighted and weighted graphs
Dijkstra’s algorithm\