Data Structures, Algorithms.
types that represent collections of elements. They have specific rules for adding and removing elements. Key Points: Stacks: LIFO (Last-In, First-Out) structure. Operations: Push (add), Pop (remove). Use Cases: Function call management, undo operations. Queues: FIFO (First-In, First-Out) structure.