Quiz: DFS Complexity

You run DFS on a tree with $n$ nodes where every node has exactly $1$ child (a straight chain). What is the maximum recursion depth?

1. A.$n$
2. B.$\log n$
3. C.$2$
4. D.$n/2$