LeetCode108.有序数组转二叉搜索树

题目

class Solution {
public:
    TreeNode* sortedArrayToBST(vector<int>& nums) {
        if(nums.size() == 0) return NULL;
        return build_BST(nums,0,nums.size()-1);
    }
    TreeNode* build_BST(vector<int>& nums,int low,int high){
        if(low > high) return NULL;

        int mid = (low + high) / 2; 
        TreeNode* root = new TreeNode(nums[mid]); 
        root->left = build_BST(nums,low,mid-1);
        root->right = build_BST(nums,mid+1,high);
        return root;
    }
};

出现 AddressSanitizer:DEADLYSIGNAL  stackoverflow的错误内存溢出，去查看递归出口是否写了？是否正确？