maximum-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 the <code>root</code> of a binary tree, return its maximum depth.

A binary tree&#39;s maximum depth&nbsp;is the number of nodes along the longest path from the root node down to the farthest leaf node.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/26/tmp-tree.jpg" style="width: 400px; height: 277px;" />
<pre>
Input: root = [3,9,20,null,null,15,7]
Output: 3
</pre>

Example 2:

<pre>
Input: root = [1,null,2]
Output: 2
</pre>

&nbsp;
Constraints:

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

maxDepth

Maximum Depth of Binary Tree

Balanced Binary Tree

balanced-binary-tree

平衡二叉树

Minimum Depth of Binary Tree

minimum-depth-of-binary-tree

二叉树的最小深度

Maximum Depth of N-ary Tree

maximum-depth-of-n-ary-tree

N 叉树的最大深度

Time Needed to Inform All Employees

time-needed-to-inform-all-employees

通知所有员工所需的时间

Amount of Time for Binary Tree to Be Infected

amount-of-time-for-binary-tree-to-be-infected

感染二叉树需要的总时间

Height of Binary Tree After Subtree Removal Queries

height-of-binary-tree-after-subtree-removal-queries

移除子树后的二叉树高度

Tree

Depth-First Search

Breadth-First Search

Binary Tree

给定一个二叉树 <code>root</code> ，返回其最大深度。

二叉树的 最大深度 是指从根节点到最远叶子节点的最长路径上的节点数。

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode.com/uploads/2020/11/26/tmp-tree.jpg" style="width: 400px; height: 277px;" />

&nbsp;

<pre>
输入：root = [3,9,20,null,null,15,7]
输出：3
</pre>

示例 2：

<pre>
输入：root = [1,null,2]
输出：2
</pre>

&nbsp;

提示：

<ul>
	<li>树中节点的数量在&nbsp;<code>[0, 104]</code>&nbsp;区间内。</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
</ul>