class Solution {
public:
TreeNode* sortedArrayToBST(vector<int>& nums) {
int right = nums.size()-1;
return helper(nums,0,right);
}
TreeNode * helper(vector<int>&nums,int left,int right){
if(left>right){
return NULL;
}
int mid = (left-right)/2+right;
TreeNode *root = new TreeNode(nums[mid]);
root->left=helper(nums,left,mid-1);
root->right=helper(nums,mid+1,right);
return root;
}
};
有序数组建立高度最低二叉排序树
最新推荐文章于 2022-03-15 21:44:28 发布