Count the deepest active call chain

For recursion that reaches depth n, call-stack space is O(n), even if each frame stores only a few values. Count the deepest active chain, not the total number of calls made.