刷题记录第八十一天-将有序数组转换为二叉搜索树

class Solution {
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        return traverse(nums,0,nums.size()-1);
    }
    TreeNode* traverse(vector<int>& nums, int left, int right){
        if(left>right) return nullptr;
        int mid = (left+right)/2;
        TreeNode* root = new TreeNode(nums[mid]);
        root->left = traverse(nums,left,mid-1);
        root->right = traverse(nums,mid+1,right);
        return root;
    }
};