- Stack
- Queue
- Circular Queue
- Deque
- Priority Queue
- Linked list
- Heap
- Hash Map
-
Union Find
-
Trie
-
Minimum Spanning Tree
- Kruskal's MST Algorithm
- Prim's MST Algorithm
-
BST (Binary search Tree)
- Binary search
- BST Traverse
- Preorder, Inorder, Postorder
- Red-Black Tree
- AVL Tree (Adelson-Velskuu and Landis)
- Balanced search Tree
-
Heap
- Huffman code
-
LCA (Lowest Common Ancestor)
-
Segment Tree
- DFS
- BFS
- Topological Sorting
- Dijkstra's
- Bellman ford
- Floyd warshall
- Quick sort
- Bubble sort
- Selection sort
- Insertion sort
- Merge sort
- Quick sort
- Shell sort
- Radix sort
- LSD (Least Significant Digit)
- MSD (Most Significant Digit)
- Heap sort
- Counting sort
- Backtracking
- Dynamic Programming
- Linear Algebra
- Geometry
- Number Theory
- Convex Hull