What typically triggers a stack overflow?

A stack overflow occurs when there is too much data being pushed onto the call stack, exceeding its allocated limit. This is commonly caused by recursive function calls that do not have a proper exit condition. When a recursive function calls itself without a base case to terminate the recursion, it continues to add layers to the stack for each call. Eventually, the stack reaches its maximum size, leading to a stack overflow.

This problem is particularly prevalent in programs that erroneously implement recursion, leading to an infinite loop of function calls. For instance, if a function keeps calling itself without reducing the problem space or reaching a stopping point, the stack will grow until the memory allotted for it is exhausted.

In contrast, normal program execution typically operates within the bounds of the stack limits. Incorrect variable assignments and not implementing exception handling do not directly contribute to stack size issues in the same way that uncontrolled recursion does. Therefore, the scenario of recursive function calls without an exit condition is clearly the primary trigger for a stack overflow.