LeetCode-Solution/LeetCode108.cpp at main · nfpranta/LeetCode-Solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/**
 * 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* func(vector<int>nums, int i, int j)
    {
        if(i>j) return NULL;
        int mid=(i+j)/2;
        TreeNode *root=new TreeNode(nums[mid]);
        root->left=func(nums,i,mid-1);
        root->right=func(nums,mid+1,j);
        return root;
    }
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        int n=nums.size();
        TreeNode *ans=func(nums,0,n-1);
        return ans;
    }
};