回复：我们公司程序员的面试题目。

This problem tested your knowledge about recursion vs. iteration you learned in basic CS classes.

Some problems are more intuitive by using recursion such as: Binary Search Tree (itself is recursive data structure). But every recursive function can be rewriten using iteration.

The Fibonacci can be written in both ways. Using recursion, you may run out of stack memory very quick.