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

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>head</code> of a singly linked list where 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/2020/08/17/linked.jpg" style="width: 500px; height: 388px;" />
<pre>
Input: head = [-10,-3,0,5,9]
Output: [0,-3,9,-10,null,5]
Explanation: One possible answer is [0,-3,9,-10,null,5], which represents the shown height balanced BST.
</pre>

Example 2:

<pre>
Input: head = []
Output: []
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in <code>head</code> is in the range <code>[0, 2 * 104]</code>.</li>
	<li><code>-105 &lt;= Node.val &lt;= 105</code></li>
</ul>

sortedListToBST

Convert Sorted List to Binary Search Tree

Convert Sorted Array to Binary Search Tree

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

将有序数组转换为二叉搜索树

Create Binary Tree From Descriptions

create-binary-tree-from-descriptions

根据描述创建二叉树

Tree

Binary Search Tree

Linked List

Divide and Conquer

Binary Tree

给定一个单链表的头节点 &nbsp;<code>head</code>&nbsp;，其中的元素 按升序排序 ，将其转换为 平衡 二叉搜索树。

&nbsp;

示例 1:

<img src="https://assets.leetcode.com/uploads/2020/08/17/linked.jpg" style="height: 388px; width: 500px;" />

<pre>
输入: head = [-10,-3,0,5,9]
输出: [0,-3,9,-10,null,5]
解释: 一个可能的答案是[0，-3,9，-10,null,5]，它表示所示的高度平衡的二叉搜索树。
</pre>

示例 2:

<pre>
输入: head = []
输出: []
</pre>

&nbsp;

提示:

<ul>
	<li><code>head</code>&nbsp;中的节点数在<code>[0, 2 * 104]</code>&nbsp;范围内</li>
	<li><code>-105&nbsp;&lt;= Node.val &lt;= 105</code></li>
</ul>