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

cangjie

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

Maximum Depth of Binary Tree

maximum-depth-of-binary-tree

二叉树的最大深度

K-th Largest Perfect Subtree Size in Binary Tree

k-th-largest-perfect-subtree-size-in-binary-tree

第 K 大的完美二叉子树的大小

Check Balanced String

check-balanced-string

检查平衡字符串

Tree

Depth-First Search

Binary Tree

给定一个二叉树，判断它是否是 平衡二叉树 &nbsp;

&nbsp;

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

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

示例 3：

<pre>
输入：root = []
输出：true
</pre>

&nbsp;

提示：

<ul>
	<li>树中的节点数在范围 <code>[0, 5000]</code> 内</li>
	<li><code>-104 &lt;= Node.val &lt;= 104</code></li>
</ul>

pFad - (p)hone/(F)rame/(a)nonymizer/(d)eclutterfier! Saves Data!