In graph traversal, which statement correctly contrasts DFS and BFS space usage?

In graph traversal, which statement correctly contrasts DFS and BFS space usage?

• A. DFS uses O(n) space; BFS uses O(h) space.
• B. Both use O(n) space always.
• C. DFS uses O(h) space (stack/recursion); BFS uses O(n) in the worst case due to the queue.
• D. DFS uses more memory than BFS in all cases.

Answer: (C)