g0101_0200.s0109_convert_sorted_list_to_binary_search_tree

Class Solution

java.lang.Object

g0101_0200.s0109_convert_sorted_list_to_binary_search_tree.Solution

public class Solution
extends Object

109 - Convert Sorted List to Binary Search Tree.

Medium

Given the head of a singly linked list where elements are sorted in ascending order , convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example 1:

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.

Example 2:

Input: head = []

Output: []

Example 3:

Input: head = [0]

Output: [0]

Example 4:

Input: head = [1,3]

Output: [3,1]

Constraints:

• The number of nodes in head is in the range [0, 2 * 104].
• -105 <= Node.val <= 105

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
TreeNode	sortedListToBST(ListNode head)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

sortedListToBST

public TreeNode sortedListToBST(ListNode head)