Unit 1: Introduction to Data Structures — Arrays, Linked Lists (Singly, Doubly, Circular)

Unit 2: Stacks & Queues — Implementation, Applications

Unit 3: Trees — Binary Trees, BST, AVL Trees, Heaps, B-Trees

Unit 4: Graphs — BFS, DFS, Shortest Path (Dijkstra, Bellman-Ford), MST (Prim, Kruskal)

Unit 5: Sorting & Searching — QuickSort, MergeSort, HeapSort, Binary Search

Unit 6: Hashing — Hash Functions, Collision Resolution Techniques