Convert Sorted Array to Binary Search Tree

最新推荐文章于 2022-02-19 22:56:38 发布

撄宁之境

最新推荐文章于 2022-02-19 22:56:38 发布

阅读量520

点赞数

分类专栏： LeetCode 文章标签： LeetCode 算法

本文链接：https://blog.csdn.net/huangynn/article/details/38734273

版权

LeetCode 专栏收录该内容

67 篇文章 0 订阅

订阅专栏

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

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    void fillValue(vector<int>& num,int l,int r, TreeNode* &node){
        if(l>r) return;
        int m=(l+r)/2;
        node=new TreeNode(num[m]);
        fillValue(num,l,m-1,node->left);
        fillValue(num,m+1,r,node->right);
    }
    TreeNode *sortedArrayToBST(vector<int> &num) {
        TreeNode*  head=NULL;
        fillValue(num,0,num.size()-1,head);
        return head;
    }
};