coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 20:16:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

44
leetcode-cn/problem (Chinese)/平衡二叉树 [ping-heng-er-cha-shu-lcof].html Normal file
View File

@@ -0,0 +1,44 @@
<p>输入一棵二叉树的根节点，判断该树是不是平衡二叉树。如果某二叉树中任意节点的左右子树的深度相差不超过1，那么它就是一棵平衡二叉树。</p>
<p> </p>
<p><strong>示例 1:</strong></p>
<p>给定二叉树 <code>[3,9,20,null,null,15,7]</code></p>
<pre>
3
/ \
9 20
/ \
15 7</pre>
<p>返回 <code>true</code> 。<br />
<br />
<strong>示例 2:</strong></p>
<p>给定二叉树 <code>[1,2,2,3,3,null,null,4,4]</code></p>
<pre>
1
/ \
2 2
/ \
3 3
/ \
4 4
</pre>
<p>返回 <code>false</code> 。</p>
<p> </p>
<p><strong>限制：</strong></p>
<ul>
<li><code>0 <= 树的结点个数 <= 10000</code></li>
</ul>
<p>注意：本题与主站 110 题相同：<a href="https://leetcode-cn.com/problems/balanced-binary-tree/">https://leetcode-cn.com/problems/balanced-binary-tree/</a></p>
<p> </p>