coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 02:41:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
leetcode-cn/problem (Chinese)/二叉树的最大深度 [maximum-depth-of-binary-tree].html
View File

@@ -1,16 +1,32 @@
<p>给定一个二叉树，找出其最大深度。</p>
<p>给定一个二叉树 <code>root</code> ，返回其最大深度。</p>
<p>二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。</p>
<p>二叉树的 <strong>最大深度</strong> 是指从根节点到最远叶子节点的最长路径上的节点数。</p>
<p><strong>说明:</strong>&nbsp;叶子节点是指没有子节点的节点。</p>
<p>&nbsp;</p>
<p><strong>示例：</strong><br>
给定二叉树 <code>[3,9,20,null,null,15,7]</code>，</p>
<p><strong>示例 1：</strong></p>
<pre> 3
/ \
9 20
/ \
15 7</pre>
<p><img alt="" src="https://assets.leetcode.com/uploads/2020/11/26/tmp-tree.jpg" style="width: 400px; height: 277px;" /></p>
<p>返回它的最大深度&nbsp;3 。</p>
<p>&nbsp;</p>
<pre>
<b>输入：</b>root = [3,9,20,null,null,15,7]
<b>输出：</b>3
</pre>
<p><strong>示例 2：</strong></p>
<pre>
<b>输入：</b>root = [1,null,2]
<b>输出：</b>2
</pre>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li>树中节点的数量在&nbsp;<code>[0, 10<sup>4</sup>]</code>&nbsp;区间内。</li>
<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>