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

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

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

Linked List

Divide and Conquer

Tree

Binary Search Tree

Binary Tree

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs