102. Binary Tree Level Order Traversal

Description

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

Constraints

Approach

Examples

Input: [3, 9, 20, null, null, 15, 7]

Output:

[

[3],

[9, 20],

[15, 7]

]

Solutions

// Definition for a binary tree node.
public class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    
    TreeNode() {}
    
    TreeNode(int val) { this.val = val; }
    
    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}

Follow up

  • Level order traversal in spiral form - GFG

  • Reverse Level Order traversal in spiral form - GFG

Last updated

Was this helpful?