Stack (LIFO) Stack (Last In, First Out): Think of a stack of plates. push() adds to top, pop() removes from top. Used for undo functionality, function call stacks, bracket matching, and backtracking algorithms. Queue (FIFO) Queue (First In, First Out): Think of a line at a store. enqueue() adds to back, dequeue() removes from front. Used for task scheduling, BFS traversal, message queues, and printer spooling. Hash Map Hash Map (O(1) average lookup): Maps keys to values using a hash function. JavaScript's Map and Object, Python's dict, Java's HashMap. Used for caching, counting frequencies, and fast lookups. Collisions are handled via chaining or open addressing.