Performance of Recursive vs Iterative Solution to "Maximum Depth of a Binary Tree"
The obvious recursive solution (compute the maximal depth of both subtrees, add one for the root) has space complexity $O(\operatorname{depth}(T))$ (i.e., $O(\log n)$  for $n$ nodes). If you write it recursively or do the call stack by hand instead of having the language handle it for you is irrelevant.