Stack
A last-in, first-out pile: you push an item and pop the one on top. Function calls use one implicitly, which is why recursion has a depth limit.
- See also: Queue
- See also: Recursion
- Used in: Data Structure Basics
A last-in, first-out pile: you push an item and pop the one on top. Function calls use one implicitly, which is why recursion has a depth limit.