Binary Tree Level Order Traversal · Coding Interview Practice

Binary Tree Level Order TraversalGiven the root of a binary tree, return the level order traversal of its node values (left to right, level by level).Constraints

The number of nodes is in the range [0, 2000]

-1000 <= Node.val <= 1000

Examples

Input: root = [3,9,20,null,null,15,7] Output: [[3],[9,20],[15,7]]

Input: root = [1] Output: [[1]]

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…