(有序链表没办法直接找到begin和end算出mid只能用三指针)
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.
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:
Given the sorted linked list: [-10,-3,0,5,9],
One possible answer is: [0,-3,9,-10,null,5], which represents
the following height balanced BST:
0
/ \
-3 9
/ /
-10 5
一般找中点两个指针就好,如果是断开链表就要再加一个pre指针标志前面的节点
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* sortedListToBST(ListNode* head) {
if(head==NULL){//链表没有结点
return NULL;
}
if(head->next==NULL){//链表只有一个结点
return new TreeNode(head->val);//注意head是一个链表节点,要返回新建的树
}
//找到链表中间结点(新建mid节点),然后对左右两个链表进行递归新建
//需要找个slow结点,到达中间结点时,断开
//退出while循环时,slow结点指向中间结点。pre结点指向中间结点的前一个
ListNode*pre=head;
ListNode*slow=head->next;
ListNode*fast=head->next->next;
while(fast!=NULL&&fast->next!=NULL){
pre=pre->next;
fast=fast->next->next;
slow=slow->next;
}
pre->next=NULL;//断开链表
TreeNode*root=new TreeNode(slow->val);//偶数的话取后边那个为根节点
root->left=sortedListToBST(head);
root->right=sortedListToBST(slow->next);
return root;
//主要是考虑到偶数节点时,slow指向的是后半部分的第一个,因此我们需要增加一个节点pre指向前半部分来段开莲表
}
};