Binary Tree Level Order Traversal | LeetCode 102

AFFILIATE LINKS

Great resource I use to learn algorithms.
40% off Tech Interview Pro: http://techinterviewpro.com/terriblewhiteboard
20% off CoderPro: http://coderpro.com/terriblewhiteboard

Here is the full implementation.

let levelOrder = function(root) {
    let result = [];
    
    if (root === null) {
        return result;
    }
    
    let queue = [];
    queue.push(root);
    
    while (queue.length > 0) {
        let row = [];
        let rowSize = queue.length;
        
        while (rowSize > 0) {
            let currentNode = queue.shift();
            
            if (currentNode.left !== null) {
                queue.push(currentNode.left);
            }
            
            if (currentNode.right !== null) {
                queue.push(currentNode.right);
            }
            
            row.push(currentNode.val);
            rowSize--;
        }
        
        result.push(row);
    }
    
    return result;
};