balanced-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 a binary tree, determine if it is height-balanced.

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

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/06/balance_2.jpg" style="width: 452px; height: 301px;" />
<pre>
Input: root = [1,2,2,3,3,null,null,4,4]
Output: false
</pre>

Example 3:

<pre>
Input: root = []
Output: true
</pre>

&nbsp;
Constraints:

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

isBalanced

Balanced Binary Tree

Tree

Depth-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