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

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

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

@@ -0,0 +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>