i believe you meant (node.left) ?? :)

… = 0; i < n; i++) {
            let node = queue.pop()
            subarr.push(node.val)
            if (temp.left) queue.unshift(node.left)
            if (node.right) queue.unshift(node.right)
        }
        result.push(subarr)
    }
 …
Binary Tree Level Order Traversal
96
1
Sara Khandaker
Akiko Green
·Follow
Dec 28, 2020
--
i believe you meant (node.left) ?? :)
--
--
Written by Akiko Green192 Followers
·145 Following
Software Engineer, Novice Blogger, Indoor Climber and Dog sitting expert 🥰
Responses (1)
Help
Status
About
Careers
Press
Blog
Privacy
Terms
Text to speech
Teams