c++ | Binary (Divide & conquer) | 1 - liner
\nclass Solution {\npublic:\n    \n       TreeNode* res(vector<int>& nums, int start, int end) {\n        return start>=end ? NULL : new TreeNode(nums[(start + 
```\nclass Solution {\npublic:\n    \n       TreeNode* res(vector<int>& nums, int start, int end) {\n        return start>=end ? NULL : new TreeNode(nums[(start + end) / 2], res(nums, start, (start + end) / 2), res(nums, (start + end) / 2 + 1, end));\n    }\n    \n    TreeNode* sortedArrayToBST(vector<int>& nums) {\n        return res(nums, 0, nums.size());\n    }\n};\n```
['Recursion', 'C', 'Binary Tree']