What is recursion in programming?

Recursion in programming is a technique where a function calls itself in order to solve a problem. It typically involves breaking down a problem into smaller, more manageable sub-problems. Each recursive call processes a smaller portion of the problem until a base case is reached, which stops the recursion. This approach is commonly used for tasks such as calculating factorials, summing numbers, and traversing data structures like trees.