convert-sorted-array-to-binary-search-tree

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given an integer array <code>nums</code> where the elements are sorted in ascending order, convert it to a height-balanced binary search tree.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree1.jpg" style="width: 302px; height: 222px;" />
<pre>
Input: nums = [-10,-3,0,5,9]
Output: [0,-3,9,-10,null,5]
Explanation: [0,-10,5,null,-3,null,9] is also accepted:
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree2.jpg" style="width: 302px; height: 222px;" />
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree.jpg" style="width: 342px; height: 142px;" />
<pre>
Input: nums = [1,3]
Output: [3,1]
Explanation: [1,null,3] and [3,1] are both height-balanced BSTs.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>nums</code> is sorted in a strictly increasing order.</li>
</ul>

sortedArrayToBST

Convert Sorted Array to Binary Search Tree

Convert Sorted List to Binary Search Tree

convert-sorted-list-to-binary-search-tree

有序链表转换二叉搜索树

Tree

Binary Search Tree

Array

Divide and Conquer

Binary Tree

给你一个整数数组 <code>nums</code> ，其中元素已经按 升序 排列，请你将其转换为一棵 平衡 二叉搜索树。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree1.jpg" style="width: 302px; height: 222px;" />
<pre>
输入：nums = [-10,-3,0,5,9]
输出：[0,-3,9,-10,null,5]
解释：[0,-10,5,null,-3,null,9] 也将被视为正确答案：
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree2.jpg" style="width: 302px; height: 222px;" />
</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/btree.jpg" style="width: 342px; height: 142px;" />
<pre>
输入：nums = [1,3]
输出：[3,1]
解释：[1,null,3] 和 [3,1] 都是高度平衡二叉搜索树。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>nums</code> 按 严格递增 顺序排列</li>
</ul>