Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
Why is recursion depth a practical concern for DFS on large graphs or deep trees?
A
Recursion can't visit all nodes
B
Compilers forbid deep recursion
C
Each call uses stack space; deep recursion can overflow the thread stack, so use an explicit stack
D
Recursion is always slower than iteration