- Time Complexity
- Space Complexity
- Stack
- Queue
- Circular Queue
- Dequeue (Phase - II)
- Priority Queue (Phase - II)
- Linked List
- Singly-Linked List
- Doubly-Linked List
- Circular-Linked List
- Binary Search Tree (BST)
- Binary Tree
- Pre-order Traversal
- In-order Traversal
- Post-order Traversal
- Adelson-Velsky and Landis Tree (AVL)
- Red-Black Tree (Phase - II)
- Sorting
- Bubble Sort
- Selection Sort
- Insertion Sort
- Quick Sort
- Merge Sort
- Heap Sort
- Counting Sort (Phase - II)
- Radix Sort (Phase - II)
- Searching
- Linear Search
- Binary search
- Hashing
- Open Hashing
- Linear Probing
- Quadratic Probing
- Double Hash (Phase - II)
- Re-Hash (Phase - II)
- Graphs
- Breadth-First-Search (BFS)
- Depth-First-Search (DFS)
- Shortest-Path
- Dijkstra's Algorithm
- Minimum Spanning Tree (MST)
- Prim's Algorithm
- Kruskal's Algorithm