maximum-depth-of-binary-tree

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

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

Tree

Depth-First Search

Breadth-First Search

Binary Tree

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

react

vanillajs

cangjie