leetcode 108 递归-二分有序数组转换为二叉搜索树

最新推荐文章于 2020-10-23 20:40:10 发布

糖琴心

最新推荐文章于 2020-10-23 20:40:10 发布

阅读量136

点赞数

分类专栏： leetcode练习

本文链接：https://blog.csdn.net/qq_35299223/article/details/104831363

版权

leetcode练习专栏收录该内容

19 篇文章 0 订阅

订阅专栏

leetcode 108

/**
 * 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* Create(vector<int>&nums,int left,int right){
        if(left>right){
            return NULL;
        }
        int mid=(left+right)/2;
        TreeNode* root=new TreeNode(nums[mid]);
        root->left=Create(nums,left,mid-1);
        root->right=Create(nums,mid+1,right);
        return root;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        if(nums.size()==0)return NULL;
        TreeNode* root=Create(nums,0,nums.size()-1);
        return root;
    }


};

leetcode 109

/**
 * 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) {
        vector<int> vec;
        while(head!=NULL){
            vec.push_back(head->val);
            head=head->next;
        }
        TreeNode* root=buildtree(vec,0,vec.size()-1);
        return root;
    }
    //建立从[left,right]的平衡树
    TreeNode* buildtree(vector<int>& v,int left,int right){
        if(left>right){
            return NULL;
        }
        int mid=(left+right)/2;
        TreeNode* root=new TreeNode(v[mid]);
        root->left=buildtree(v,left,mid-1);
        root->right=buildtree(v,mid+1,right);
        return root;
    }

};