Back of the napkin math says that we might overflow the stack on reasonable inputs (albeit bigger than anything we've seen in practise).
So it is reasonable that we should transform traversal operations from the recursive style to an iterative style.
Back of the napkin math says that we might overflow the stack on reasonable inputs (albeit bigger than anything we've seen in practise).
So it is reasonable that we should transform traversal operations from the recursive style to an iterative style.