C++ || Binary-Search-Tree|| Nice && Simple Solution
Simple recursion soluton \n-----------------------------------------------\nAs the question already stated that we have sorted array to form the binary-search-t
# Simple recursion soluton \n-----------------------------------------------\n**As the question already stated that we have sorted array to form the binary-search-tree**\n\n```\nclass Solution {\npublic:\n    TreeNode* convertBST(int left,int right,vector<int>&arr){\n        if(left>right) return nullptr;\n        int mid = left+((right-left)/2);\n        TreeNode * root = new TreeNode(arr[mid]);\n        root->left = convertBST(left,mid-1,arr);\n        root->right = convertBST(mid+1,right,arr);\n        return root;\n    }\n    TreeNode* sortedArrayToBST(vector<int>& nums) {\n        return convertBST(0,nums.size()-1,nums);\n    }\n};\n```\n\n**TC : O(N)**\n**SC : O(1)**\n\n*If you loved this solution then please up vote to motivate me \uD83D\uDE00*\n**:) happy coding**
['Binary Search', 'Tree', 'Recursion', 'C', 'Binary Tree', 'C++']