Last-In-First-Out (LIFO) data structures where elements are added and removed from the same end (top). Stacks naturally model problems with nested or sequential processing like expression evaluation and function call management. Push adds elements, pop removes the top element, peek views without removal. Stacks have O(1) push and pop operations.