/**
* 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* sortedArrayToBST(vector<int>& nums) {
return dfs(nums,0,nums.size()-1);
}
TreeNode* dfs(vector<int>& nums,int l,int r){
if(l>r) return nullptr;
int mid=l+r>>1;
TreeNode* root=new TreeNode(nums[mid]);
root->left=dfs(nums,l,mid-1);
root->right=dfs(nums,mid+1,r);
return root;
}
};
1_最小高度树
最新推荐文章于 2022-08-19 14:15:26 发布