coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 03:26:45 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
leetcode-cn/problem (English)/最小高度树(English) [minimum-height-tree-lcci].html
View File

@@ -1,15 +1,15 @@
<p>Given a sorted (increasing order) array with unique integer elements, write an algo&shy;rithm to create a binary search tree with minimal height.</p>
<p><strong>Example:</strong></p>
<pre>
Given sorted array: [-10,-3,0,5,9],
One possible answer is: [0,-3,9,-10,null,5]，which represents the following tree:
0
/ \
-3 9
/ /
-10 5
</pre>
<p>Given a sorted (increasing order) array with unique integer elements, write an algo&shy;rithm to create a binary search tree with minimal height.</p>
<p><strong>Example:</strong></p>
<pre>
Given sorted array: [-10,-3,0,5,9],
One possible answer is: [0,-3,9,-10,null,5]，which represents the following tree: