Stack
LIFO data structure — "Last In, First Out". The last item added is the first one out.
Also "call stack": where in the calling chain your program is right now. Stack overflow = too-deep recursion. Different from the heap (dynamic memory, managed manually or via GC).