leetcode -- Convert Sorted List to Binary Search Tree

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

Top down 的解题方法：

1. 将LinkedList的值保存到一个数组中，转化成Convert Sorted Array to Binary Search Tree 来解决

时间复杂度为O(n), 空间复杂度为O(n)

 /**
  * Definition for singly-linked list.
  * public class ListNode {
  *     int val;
  *     ListNode next;
  *     ListNode(int x) { val = x; next = null; }
  * }
  */
 /**
  * Definition for binary tree
  * public class TreeNode {
  *     int val;
  *     TreeNode left;
  *     TreeNode right;
  *     TreeNode(int x) { val = x; }
  * }
  */
 public class Solution {
     public TreeNode sortedListToBST(ListNode head) {
         // Start typing your Java solution below
         // DO NOT write main() function
         if(head == null){
             return null;
         }
         int len = 0;
         ListNode p = head;
         while(p != null){
             len ++;
             p = p.next;
         }
         int[] num = new int[len];
         p = head;
         int i = 0;
         while(p != null){
             num[i++] = p.val;
             p = p.next;
         }

         return generate(num, 0, len - 1);
     }

     public TreeNode generate(int[] num, int start, int end){
         if(start > end){
             return null;
         }
         int mid = (start + end) / 2;
         TreeNode root = new TreeNode(num[mid]);
         root.left = generate(num, start, mid - 1);
         root.right = generate(num, mid + 1, end);
         return root;
     }
 }

2. 使用上题的解题思路：

遍历链表，找到中间元素，将该元素作为根节点时间复杂度为O(NlgN)

因为每层的递归调用需要遍历N/2个元素，而一共有lgN层

 /**
  * Definition for singly-linked list.
  * public class ListNode {
  *     int val;
  *     ListNode next;
  *     ListNode(int x) { val = x; next = null; }
  * }
  */
 /**
  * Definition for binary tree
  * public class TreeNode {
  *     int val;
  *     TreeNode left;
  *     TreeNode right;
  *     TreeNode(int x) { val = x; }
  * }
  */
 public class Solution {
     public TreeNode sortedListToBST(ListNode head) {
         // Start typing your Java solution below
         // DO NOT write main() function
         if(head == null){
             return null;
         }
         int len = 0;
         ListNode p = head;
         while(p != null){
             len ++;
             p = p.next;
         }
         return generate(head, len);
     }

     public TreeNode generate(ListNode head, int N){
         if(N <= 0){
             return null;
         }
         int mid = (1 + N) / 2;
         ListNode p = head;
         int tmp = mid - 1;
         while(tmp > 0){
             p = p.next;
             tmp --;
         }
         TreeNode root = new TreeNode(p.val);
         root.left = generate(head, mid - 1);
         root.right = generate(p.next, N - mid);
         return root;
     }

 }

Best Solution:
As usual, the best solution requires you to think from another perspective. In other words, we no longer create nodes in the tree using the top-down approach. We create nodes bottom-up, and assign them to its parents. The bottom-up approach enables us to access the list in its order while creating nodes.

Isn’t the bottom-up approach neat? Each time you are stucked with the top-down approach, give bottom-up a try. Although bottom-up approach is not the most natural way we think, it is extremely helpful in some cases. However, you should prefer top-down instead of bottom-up in general, since the latter is more difficult to verify in correctness.

Below is the code for converting a singly linked list to a balanced BST. Please note that the algorithm requires the list’s length to be passed in as the function’s parameters. The list’s length could be found in O(N) time by traversing the entire list’s once. The recursive calls traverse the list and create tree’s nodes by the list’s order, which also takes O(N) time. Therefore, the overall run time complexity is still O(N).

 BinaryTree* sortedListToBST(ListNode *& list, int start, int end) {
   if (start > end) return NULL;
   // same as (start+end)/2, avoids overflow
   int mid = start + (end - start) / ;
   BinaryTree *leftChild = sortedListToBST(list, start, mid-);
   BinaryTree *parent = new BinaryTree(list->data);
   parent->left = leftChild;
   list = list->next;
   parent->right = sortedListToBST(list, mid+, end);
   return parent;
 }

 BinaryTree* sortedListToBST(ListNode *head, int n) {
   return sortedListToBST(head, , n-);
 }