Given the root of a binary tree, return the node values grouped by level from top to bottom and left to right. If the tree is empty, return an empty list.
Constraints
0 <= number of nodes <= 2000
-1000 <= Node.val <= 1000
The input tree is a valid binary tree
Interviewer
Your question is Binary Tree Level Order Traversal. Start with the requirements in the Question tab.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
