47: Level order traversal of a binary tree

Given a binary tree, return level order traversal

 

Example 1

Input:     1   
          / \  
         5   3 

Output: [[1], [5, 3]]

Example 2

Input:     1   
            \  
             3 

Output: [[1], [3]]