In what situations is the use of recursive algorithms justified?

Recursive algorithms are justified in situations where the problem naturally breaks down into subproblems of the same type. This is convenient for working with:

• Trees and graphs (for example, traversing tree nodes).
• Problems where the solution is built on solutions to smaller subproblems (for example, calculating factorials, Fibonacci numbers).
• Problems with repetitive structure (for example, merge sort, quicksort).

Recursion simplifies the code and makes it more readable, but it is important to control the recursion depth to avoid stack overflow.