108. Convert Sorted Array to Binary Search Tree

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

这道题用dfs去做。代码如下：
注意TreeNode *root=new TreeNode(nums[mid])往root中加数
代码如下：
/**
* 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* help(vector<int>& nums,int left,int right){
    if(left>right)return NULL;
    else{
        int mid=(left+right)/2;
        TreeNode *root = new TreeNode(nums[mid]);
        root->left=help(nums,left,mid-1);
        root->right=help(nums,mid+1,right);
         return root;
    }

}
TreeNode* sortedArrayToBST(vector<int>& nums) {
    if(nums.size()==0)return NULL;

       return help(nums,0,nums.size()-1);

}

};