Recursion is a resource

Each frame costs stack; a linear chain of n nodes is n frames. The sandbox (like most judges) gives a few MB — depth past ~1e5 dies. The fix: explicit stack, process (node, child-index) pairs, accumulate child answers before popping. Convert every n-deep recursion once and you will recognize it forever.