Leetcode——108. 将有序数组转换为二叉搜索树

思路：中序遍历、递归

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