https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree/
给定一个单链表,其中的元素按升序排序,将其转换为高度平衡的二叉搜索树。
本题中,一个高度平衡二叉树是指一个二叉树每个节点 的左右两个子树的高度差的绝对值不超过 1。
示例:
给定的有序链表: [-10, -3, 0, 5, 9],
一个可能的答案是:[0, -3, 9, -10, null, 5], 它可以表示下面这个高度平衡二叉搜索树:
0
/ \
-3 9
/ /
-10 5
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode sortedListToBST(ListNode head) {
if(head==null){
return null;
}
//链表转数组
ListNode temp=head;
int len=1;
while(temp.next!=null){
temp=temp.next;
len++;
}
int[] num=new int[len];
temp=head;
for(int i=0;i<len;i++){
num[i]=temp.val;
temp=temp.next;
}
//构造树
return buildtree(num,0,len-1);
}
public TreeNode buildtree(int[] num,int left,int right){
if(left>right){
return null;
}
//根节点为中点
int middle=(left+right)/2;
TreeNode root=new TreeNode(num[middle]);
//递归构造左右子树
root.left=buildtree(num,left,middle-1);
root.right=buildtree(num,middle+1,right);
return root;
}
}