Convert Sorted Array to Binary Search Tree-LeetCode

最新推荐文章于 2024-10-08 10:36:00 发布

「已注销」

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量267

点赞数

分类专栏： LeetCode 文章标签： leetcode C++

本文链接：https://blog.csdn.net/tung_hit/article/details/44996121

版权

LeetCode 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

递归建树：

TreeNode *sortedArrayToBST(vector<int> &num) {
        if(num.size()==0) return nullptr;
        TreeNode* root;
        createBST(num,0,num.size()-1,root);
        return root;
    }
    void createBST(vector<int> &num,int low,int high,TreeNode* &root)
    {
        if(low>high) return;
        int mid=(low+high)/2;
        root=new TreeNode(num.at(mid));
        //root=(TreeNode*)malloc(sizeof(TreeNode));root->val=num.at(mid);
        createBST(num,low,mid-1,root->left);
        createBST(num,mid+1,high,root->right);
    }