/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* solve(vector<int>&num, int l, int r){
if(l>r) return NULL;
int m = (l+r)/2;
TreeNode* root = new TreeNode(num[m]);
root->left = solve(num, l, m-1);
root->right = solve(num, m+1, r);
return root;
}
TreeNode* sortedArrayToBST(vector<int>& nums) {
return solve(nums, 0, nums.size()-1);
}
};
leetcode108+Convert Sorted Array to Binary Search Tree+递归+二分
最新推荐文章于 2024-06-22 21:53:36 发布