Comparing the Recursive and Iterative Processes

Compare the diagram for iterative (factorial-product 1 3):

Q: Why doesn't the diagram "bulge" out to the right when factorial-product is called repetitively?

A: Because the call is the last thing the procedure performs; it does not have to finish a previous problem put "on hold".

The memory required is constant no matter what the value of n is.