Suggest an editImprove this articleRefine the answer for “What does "call stack" mean in programming?”. Your changes go to moderation before they’re published.Approval requiredContentWhat you’re changing🇺🇸EN🇺🇦UAPreviewTitle (EN)Short answer (EN)A **call stack** is an area of memory where the program stores information about all active function calls. **Key point:** each call pushes a stack frame with arguments, local variables, and the return address, and an overflow of the stack causes a stack overflow error.Shown above the full answer for quick recall.Answer (EN)ImageA **call stack** is an area of memory where the program stores information about all active (not yet completed) function calls. When a function is called: 1. A new **stack frame** is added to the stack: it stores the function's arguments, its local variables, and the return address. 2. When the function finishes, its frame is removed from the stack, and control returns to the place where the call was made. If a function calls itself many times and the stack overflows, a **stack overflow** error occurs. In simpler terms, the call stack is a **history of the current function calls**, organized on the **LIFO** principle.For the reviewerNote to the moderator (optional)Visible only to the moderator. Helps review go faster.