BINARY TREE LEVEL ORDER TRAVERSAL
+========+
Time: 30 minutes - 1 hour
Difficulty: Medium
Languages: Any
+========+
Given the root of a binary tree, implement a function that performs a level-order traversal of the tree, and returns a list of lists, where each list contains the nodes at that level.
+========+
Please answer to this message with your solution 🙂
>>Click here to continue<<