> A good tree will have something like log(n) depth so normal recursion should be fine. But in many contexts you have to be robust against a bad tree. > Apart

> A good tree will have something like log(n) depth so normal recursion should be fine. But in many contexts you have to be robust against a bad tree. > Apart from recursive algorithms, stack size can be determined by static analysis. Not always, in the presence of dynamically sized arrays (or alloca and friends).