A work in progress. Written as a refresher for how some key abstract data types are implemented.
Currently the data in a node must be a primitive data type for any ordering and comparision to work
- Binary Search Tree
- Stack
- MaxHeap
- MinHeap
- Trie
- Queue (Inefficiant use of array.shift())
- Graph (Missing bi-directional search)
- Linked List
- ArrayList
- Map