Leetcode-109. Convert Sorted List to Binary Search Tree

最新推荐文章于 2019-02-13 14:35:13 发布

forest小拳拳

最新推荐文章于 2019-02-13 14:35:13 发布

阅读量105

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/qq_33097439/article/details/86522326

版权

Leetcode 专栏收录该内容

97 篇文章 0 订阅

订阅专栏

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

/**
 * 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) {
        return ListToBST(head,NULL);
    }
    
    TreeNode*ListToBST(ListNode* head, ListNode* tail){
        if(head==tail)
            return NULL;
        if(head->next==tail){
            TreeNode *root = new TreeNode(head->val);
            return root;
        }
        //finding the middle element
        ListNode* mid=head;
        ListNode* pointer=head;
        while(pointer!=tail&&pointer->next!=tail){
            mid=mid->next;
            pointer=pointer->next->next;
        }
        TreeNode* root=new TreeNode(mid->val);
        root->left=ListToBST(head,mid);
        root->right=ListToBST(mid->next,tail);
        return root;

    }
};