Data Structures
Chapters
1. Arrays and Strings
Operations, complexity, common patterns.
2. Linked Lists
Singly, doubly, circular; common operations and pitfalls.
3. Stacks and Queues
Operations, applications (parenthesis, BFS, expression eval).
4. Trees and BSTs
Traversals, BST operations, AVL, red-black, B-tree basics.
5. Heaps
Min/max heap, priority queue, heapsort.
6. Hashing
Hash functions, collision resolution, applications.