二叉搜索树的后序遍历序列

题目描述
输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。

public static boolean VerifySquenceOfBST(int[] sequence) {
        if(sequence == null || sequence.length == 0){
            return false;
        }
        int center = sequence[sequence.length - 1];
        int num = 0;
        for(int i = 0; i < sequence.length; ){//查找左子树
            if(sequence[i] < center){
                num++;
                i++;
            }else{
                break;
            }
        }
        int[] left = new int[num];
        int[] right = new int[sequence.length - num -1];
        for(int i = 0; i < num; i++){
            left[i] = sequence[i];
        }
        int i = 0;
        for(i = num; i < sequence.length - 1; i++){//查找右子树
            if(sequence[i] >= center){判断是否满足二叉搜索树的特征，不满足则返回false
                right[i - num] = sequence[i];
            }else{
                return false;
            }
        }
        if(i == sequence.length - 1){//判断是否满足二叉搜索树的特征，满足则返回true
            return true;
        }
        boolean l = true,r = true;
        if(left.length > 0){
            l = VerifySquenceOfBST(left);
        }
        if(right.length > 0){
            r = VerifySquenceOfBST(right);
        }
        return l && r;
    }