mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
17 lines
424 B
HTML
17 lines
424 B
HTML
|
<p>给定一个二叉树，找出其最大深度。</p>
|
|||
|
|
|
|||
|
|
<p>二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。</p>
|
|||
|
|
|
|||
|
|
<p><strong>说明:</strong> 叶子节点是指没有子节点的节点。</p>
|
|||
|
|
|
|||
|
|
<p><strong>示例：</strong><br>
|
|||
|
|
给定二叉树 <code>[3,9,20,null,null,15,7]</code>，</p>
|
|||
|
|
|
|||
|
|
<pre> 3
|
|||
|
|
/ \
|
|||
|
|
9 20
|
|||
|
|
/ \
|
|||
|
|
15 7</pre>
|
|||
|
|
|
|||
|
|
<p>返回它的最大深度 3 。</p>
|