deven/leetcode
1
0
Fork 0
mirror of https://github.com/devenperez/leetcode.git synced 2026-06-13 14:57:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Create README - LeetHub

Browse Source
This commit is contained in:
Deven
2025-10-02 12:51:44 -04:00
parent f504060d03
commit 5b455306a4
1 changed files with 31 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
0102-binary-tree-level-order-traversal/README.md
+31
View File
@@ -0,0 +1,31 @@
<h2><a href="https://leetcode.com/problems/binary-tree-level-order-traversal">102. Binary Tree Level Order Traversal</a></h2><h3>Medium</h3><hr><p>Given the <code>root</code> of a binary tree, return <em>the level order traversal of its nodes&#39; values</em>. (i.e., from left to right, level by level).</p>
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/tree1.jpg" style="width: 277px; height: 302px;" />
<pre>
<strong>Input:</strong> root = [3,9,20,null,null,15,7]
<strong>Output:</strong> [[3],[9,20],[15,7]]
</pre>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> root = [1]
<strong>Output:</strong> [[1]]
</pre>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> root = []
<strong>Output:</strong> []
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>
<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>