minimum-depth-of-binary-tree

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Note:&nbsp;A leaf is a node with no children.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg" style="width: 432px; height: 302px;" />
<pre>
Input: root = [3,9,20,null,null,15,7]
Output: 2
</pre>

Example 2:

<pre>
Input: root = [2,null,3,null,4,null,5,null,6]
Output: 5
</pre>

&nbsp;
Constraints:

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

minDepth

Minimum Depth of Binary Tree

Binary Tree Level Order Traversal

binary-tree-level-order-traversal

二叉树的层序遍历

Maximum Depth of Binary Tree

maximum-depth-of-binary-tree

二叉树的最大深度

Tree

Depth-First Search

Breadth-First Search

Binary Tree

给定一个二叉树，找出其最小深度。

最小深度是从根节点到最近叶子节点的最短路径上的节点数量。

说明：叶子节点是指没有子节点的节点。

 

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/12/ex_depth.jpg" style="width: 432px; height: 302px;" />
<pre>
输入：root = [3,9,20,null,null,15,7]
输出：2
</pre>

示例 2：

<pre>
输入：root = [2,null,3,null,4,null,5,null,6]
输出：5
</pre>

 

提示：

<ul>
	<li>树中节点数的范围在 <code>[0, 105]</code> 内</li>
	<li><code>-1000 <= Node.val <= 1000</code></li>
</ul>