# Convert Sorted List to Binary Search Tree LeetCode

249人阅读 评论(0)

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

/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
/**
* Definition for a binary tree node.
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
public class Solution {
private ListNode current;
return 0;
}
int size = 0;
while (temp != null) {
size++;
temp = temp.next;
}
return size;
}
public TreeNode getCurrentTreeNodeHelper(int size) {
if (size == 0) {
return null;
}
TreeNode left = getCurrentTreeNodeHelper(size / 2);
TreeNode root = new TreeNode(current.val);
current  = current.next;
TreeNode right = getCurrentTreeNodeHelper(size - 1 - size / 2);

root.left = left;
root.right = right;
return root;
}
TreeNode dummy = getCurrentTreeNodeHelper(size);

return dummy;
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：78425次
• 积分：3013
• 等级：
• 排名：第12025名
• 原创：234篇
• 转载：4篇
• 译文：0篇
• 评论：1条
最新评论