Common Problems
- Traversal
- Lowest Common Ancestor in a BST
Graphs
Representations
- Adjacency List
- Adjacency Matrix
Algorithms
- DFS
- BFS
- Dijkstra’s
- Bellman-Ford
- Floyd-Warshall
- A_search_
Common Problems
- BFS and DFS traversal
- Shortest path (Dijkstra’s algorithm)