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