My implementations of some data structures and well-known algorithms
- Binary Search Tree
- Bloom Filter
- Graph Representations - Adjacency List, Adjacency Matrix, and Graph Nodes
- Min Heap
- Linked List
- Binary Search
- Boyer & Moore's Majority Vote
- Dijkstra's Shortest Path - Naive Method with Adjacency Matrix
- Dijkstra's Shortest Path - Heap Method with Adjacency List
- Depth First Search, Breadth First Search, and Topological Sort
- Kosaraju's Strongly Connected Components
- Merge Sort
- Prim's Minimum Spanning Tree