Dynamic Programming, Divide and Conquer, Recursion, Backtracking, Greedy etc.

Introduction, Insertion, Deletion, Searching, Sorting

Stacks: Concepts, Implementation, Applications (e.g., Balancing Symbols, Postfix Evaluation) Queues: Types (Simple Queue, Circular Queue, Priority Queue) Deque and Applications Real-World Use Cases

Introduction to Trees and Terminologies Binary Trees: Traversals (Inorder, Preorder, Postorder) Binary Search Tree (BST): Insertion, Deletion, Search AVL Trees: Rotations and Balancing Heaps: Min-Heap, Max-Heap, Heap Sort Introduction to Graph Graph Traversals Shortest Path Algorithms Prims and Kruskal Algorithms

Introduction to Hashing Hashing Techniques Collision Resolution Techniques