Master the building blocks of efficient algorithms. From arrays to advanced trees and graphs.
Memory layout, access patterns, amortized cost.
Singly, doubly, and circular linked lists.
LIFO/FIFO structures and applications.
Structure, traversals, and properties.
Insert, delete, search operations.
Self-balancing BST with rotations.
Min-heap, max-heap, heapify.
Hash functions, collision resolution.
Real-world applications and complexity.
Adjacency list vs matrix.
Breadth-first and depth-first traversal.
Dijkstra, Bellman-Ford, Floyd-Warshall.
