Your question is Traverse Tree Up to Depth. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Tell me about how you would write a function that traverses a tree represented by a children-callback and returns nodes up to a given maximum depth.