binary-tree-level-order-traversal

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given the <code>root</code> of a binary tree, return the level order traversal of its nodes&#39; values. (i.e., from left to right, level by level).

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg" style="width: 277px; height: 302px;" />
<pre>
Input: root = [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]
</pre>

Example 2:

<pre>
Input: root = [1]
Output: [[1]]
</pre>

Example 3:

<pre>
Input: root = []
Output: []
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the tree is in the range <code>[0, 2000]</code>.</li>
	<li><code>-1000 &lt;= Node.val &lt;= 1000</code></li>
</ul>

levelOrder

Binary Tree Level Order Traversal

Tree

Breadth-First Search

Binary Tree

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie