/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode *sortListBST(ListNode *&head,int beg,int end)
{//没有加引用,提交的结果全都是空,没有加引用,并没有改变最初的值!!!
if(beg>end) return NULL;
int middle=(beg+end)/2;
TreeNode *leftTree=sortListBST(head,beg,middle-1);
TreeNode *node=new TreeNode(head->val);
node->left=leftTree;
head=head->next;
TreeNode *rightTree=sortListBST(head,middle+1,end);
node->right=rightTree;
return node;
}
TreeNode *sortedListToBST(ListNode *head) {
int len=0;
ListNode *p=head;
while(p)
{
p=p->next;
len++;
}
return sortListBST(head,0,len-1);
}
};
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode *sortListBST(ListNode *&head,int beg,int end)
{//没有加引用,提交的结果全都是空,没有加引用,并没有改变最初的值!!!
if(beg>end) return NULL;
int middle=(beg+end)/2;
TreeNode *leftTree=sortListBST(head,beg,middle-1);
TreeNode *node=new TreeNode(head->val);
node->left=leftTree;
head=head->next;
TreeNode *rightTree=sortListBST(head,middle+1,end);
node->right=rightTree;
return node;
}
TreeNode *sortedListToBST(ListNode *head) {
int len=0;
ListNode *p=head;
while(p)
{
p=p->next;
len++;
}
return sortListBST(head,0,len-1);
}
};