Welcome to your interview.
The question is on your right: DFS and BFS on Binary Trees. Take a moment with it first.
Talk your thinking through with me if you like - when you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes). Discussion and graded submissions share your five interviewer interactions, so spend them well.
Traverse a binary tree using depth-first search and breadth-first search, and explain the space complexity of each.