输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
BST : binary serach tree 二叉查找树/二叉搜索树
public boolean VerifySquenceOfBST(int[] sequence) {
if (sequence.length == 0) {
return false;
}
return isTreeBST(sequence, 0, sequence.length - 1);
}
private boolean isTreeBST(int[] sequences, int start, int end) {
if (start >= end) {
return true;
}
int i = start;
while (i < end && sequences[i] < sequences[end]) {
i++;
}
for (int j = i; j < end; j++) {
if (sequences[j] <= sequences[end]) {
return false;
}
}
return isTreeBST(sequences, start, i - 1) && isTreeBST(sequences, i, end - 1);
}