Binary Tree Level Order Traversal (easy)
Given a binary tree, populate an array to represent its level-by-level traversal. You should populate the values of all nodes of each level from left to right in separate sub-arrays.
Try it yourself
Try solving this question here: