Binary Tree Level Order Tranversal

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

Tags

Tree, BFS

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number[][]}
 */
var levelOrder = function(root) {
    if(root === null) {
        return [];
    }
    
    if(root.left === null && root.right === null) {
        return [root];
    }
    
    var ret = [];
    var lastLevel = [root];
    while(lastLevel.length > 0) {
        var currentLevel = [];
        var lastLevelData = [];
        
        for(var i in lastLevel) {
            lastLevelData.push(lastLevel[i].val);
            
            if(lastLevel[i].left) {
                currentLevel.push(lastLevel[i].left);
            }
            
            if(lastLevel[i].right) {
                currentLevel.push(lastLevel[i].right);
            }
        }
        
        ret.push(lastLevelData);
        lastLevel = currentLevel;
    }
    
    return ret;
};