A last-in, first-out data structure where the most recently added item is removed first.
A data structure that follows the LIFO (last-in, first-out) principle, also used for things like managing function calls. The data structure gets its name from the exact mechanism used for function calls -- local variables and return addresses get pushed onto a stack with every call -- and recursion that goes too deep exhausts that space, causing a stack overflow.
© 2026 ITBGM