Package g0101_0200.s0109_convert_sorted_list_to_binary_search_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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: []

    Constraints:

    • The number of nodes in head is in the range <code>0, 2 * 10<sup>4</sup></code>.

    • <code>-10<sup>5</sup><= Node.val <= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

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

      • Methods inherited from class java.lang.Object

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