Your question is BST Level-Order Printing. 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).
How would you implement a Binary Search Tree and print it level-by-level?