Convert Sorted Array to Binary Search Tree 将数组转换成二叉查找树

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
     TreeNode *arraytoBST(vector<int> &vec,int left,int right)
{
    if(left>right) return NULL;
int  middle=(left+right)/2;
TreeNode *root=new TreeNode(vec[middle]);
root->left=arraytoBST(vec,left,middle-1);
root->right=arraytoBST(vec,middle+1,right);
return root;
}
    TreeNode *sortedArrayToBST(vector<int> &num) {
        return arraytoBST(num,0,num.size()-1);
    }
};