Recursion vs manual stacks - which is preferable in this case?

Question

A recursive program creates a stack within itself and forces users to write less code.

Are there any cases where recursion is really preferable over manual stacks for a reason other than the one mentioned above?

EDIT 1:

How is dynamic memory allocation more expensive than heap allocations by a recursive program?

Answer 1

, , , " ", . , , , . ( , ? , if/else while ?)

- , . ; ; , ( : : " ", , ), , ; , , , () .

Answer 2

@ruakh. , ( , , ) ( ) , , , .