easy to understand[binary search][c++]
\n\n        class Solution {\n        public:\n            TreeNode sortedArrayToBST(int start,int end,vector& nums) {\n                if(start>end) return nul
\n\n        class Solution {\n        public:\n            TreeNode* sortedArrayToBST(int start,int end,vector<int>& nums) {\n                if(start>end) return nullptr;\n                int mid=start + (end-start)/2;\n                TreeNode* root=new TreeNode(nums[mid]);\n                root->left=sortedArrayToBST(start,mid-1,nums);\n                root->right=sortedArrayToBST(mid+1,end,nums);\n                return root;\n            }\n            TreeNode* sortedArrayToBST(vector<int>& nums) {\n               return sortedArrayToBST(0,nums.size()-1,nums);\n            }\n    \n        };\n\t\t\n**Feel free to ask any question in the comment section.\nIf you like this solution, do UPVOTE.\nHappy Coding :)**\n
['Recursion', 'C', 'Binary Tree', 'C++']