Skip to content

Commit c60318c

Browse files
committed
Added README.md file for Balanced Binary Tree
1 parent d40e57d commit c60318c

File tree

1 file changed

+31
-0
lines changed

1 file changed

+31
-0
lines changed

110-balanced-binary-tree/README.md

Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
<h2><a href="https://leetcode.com/problems/balanced-binary-tree">Balanced Binary Tree</a></h2> <img src='https://img.shields.io/badge/Difficulty-Easy-brightgreen' alt='Difficulty: Easy' /><hr><p>Given a binary tree, determine if it is <span data-keyword="height-balanced"><strong>height-balanced</strong></span>.</p>
2+
3+
<p>&nbsp;</p>
4+
<p><strong class="example">Example 1:</strong></p>
5+
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/06/balance_1.jpg" style="width: 342px; height: 221px;" />
6+
<pre>
7+
<strong>Input:</strong> root = [3,9,20,null,null,15,7]
8+
<strong>Output:</strong> true
9+
</pre>
10+
11+
<p><strong class="example">Example 2:</strong></p>
12+
<img alt="" src="https://assets.leetcode.com/uploads/2020/10/06/balance_2.jpg" style="width: 452px; height: 301px;" />
13+
<pre>
14+
<strong>Input:</strong> root = [1,2,2,3,3,null,null,4,4]
15+
<strong>Output:</strong> false
16+
</pre>
17+
18+
<p><strong class="example">Example 3:</strong></p>
19+
20+
<pre>
21+
<strong>Input:</strong> root = []
22+
<strong>Output:</strong> true
23+
</pre>
24+
25+
<p>&nbsp;</p>
26+
<p><strong>Constraints:</strong></p>
27+
28+
<ul>
29+
<li>The number of nodes in the tree is in the range <code>[0, 5000]</code>.</li>
30+
<li><code>-10<sup>4</sup> &lt;= Node.val &lt;= 10<sup>4</sup></code></li>
31+
</ul>

0 commit comments

Comments
 (0)