Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

Subscribe to see which companies asked this qu

/** * 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* build(vector<int>& nums,int left, int right)    {        if(left>=right)        return NULL;        int mid=(right-left)/2+left;        TreeNode* root= new TreeNode(nums[mid]);        root->left=build(nums,left,mid);        root->right=build(nums,mid+1,right);        return root;    }    TreeNode* sortedArrayToBST(vector<int>& nums)     {         return build(nums,0,nums.size());    }};

estion