108. Convert Sorted Array to Binary Search Tree

Solution

• We can convert sorted array to BST with the help of binary search.
• every time mid is our root node and its left will be left of mid and right will be right of mid.
• TC: O(N logN)
• SC: O(logN)

Code

class Solution {
private:
    TreeNode* helper(vector<int>& nums, int l, int r)
    {
        if (l > r) return NULL;
        int m = l + (l - r) / 2;
        TreeNode* root = new TreeNode(nums[m]);
        root->left = helper(nums, l, m - 1);
        root->right = helper(nums, m + 1, r);
        return root;
    }

public:
    TreeNode* sortedArrayToBST(vector<int>& nums)
    {
        if (nums.size() == 0) return NULL;
        return helper(nums, 0, nums.size() - 1);
    }
};