Given the root of a binary tree, return its level order traversal as a list of lists, one list per depth from left to right. Implement it using recursion rather than an explicit queue.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.