A Swift 2.0 implementation of Data Structures described in Algorithms 4th Edition (R. Sedgewick & K. Wayne)
A rough idea of what will be implemented (or built upon other data structures):
- Linked List
- Bag
- Queue
- Stack
- Priority Queue (min/max)
- Symbol Table
- Binary Tree, 2-3 Tree, Red-Black Tree
- Hash Table
- Trie
- Graph, Directed Graph, Weighted Graph
- more TBD
These Data Structures will be used to develop Algorithms inside of a sister-repository: Algorithms