mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
29 lines
860 B
HTML
29 lines
860 B
HTML
<p>Given a binary tree, find its minimum depth.</p>
|
|
|
|
<p>The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.</p>
|
|
|
|
<p><strong>Note:</strong> A leaf is a node with no children.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg" style="width: 432px; height: 302px;" />
|
|
<pre>
|
|
<strong>Input:</strong> root = [3,9,20,null,null,15,7]
|
|
<strong>Output:</strong> 2
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> root = [2,null,3,null,4,null,5,null,6]
|
|
<strong>Output:</strong> 5
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the tree is in the range <code>[0, 10<sup>5</sup>]</code>.</li>
|
|
<li><code>-1000 <= Node.val <= 1000</code></li>
|
|
</ul>
|