terminal
Elevo
code
Topics
corporate_fare
Companies
history
History
arrow_back Back to Challenges

#102 Binary Tree Level Order Traversal

Medium Acceptance 0%
Editorial
description

Problem Description

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

checklist Constraints

The number of nodes in the tree is in the range [0, 2000].
-1000 <= Node.val <= 1000

science Examples

Case #1

In: root = [3,9,20,null,null,15,7]
Out: [[3],[9,20],[15,7]]

Case #2

In: root = [1]
Out: [[1]]

Mastery Tags

Graphs Trees

Hiring Companies

Amazon Meta Microsoft
code

Integrated IDE

Login to Compile
code_blocks
Coding
psychology
Aptitude