Tree traversal under pressure
Return a binary tree in level order. Compare an iterative queue with recursion and test an empty tree and a long chain.
What a strong answer demonstrates
A correct traversal, bounded auxiliary memory, and a clear explanation of the trade-off.