标题【编程题】二叉搜索树的后序遍历序列(Java实现)
题目来源
剑指offer第23题
https://www.nowcoder.com/questionTerminal/a861533d45854474ac791d90e447bafd
题目描述
输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历的结果。如果是则输出Yes,否则输出No。假设输入的数组的任意两个数字都互不相同。
题目代码
public class Solution {
public boolean VerifySquenceOfBST(int [] sequence) {
if(sequence==null||sequence.length==0)
return false;
return SequenceOfBST(sequence,0,sequence.length-1);
}
public boolean SequenceOfBST(int[] sequence,int low,int high){
if(low>high)
return true;
int i=low;
for(;i<high;i++){
if(sequence[i]>=sequence[high])
break;
}
for(int j=i;j<high;j++){
if(sequence[j]<=sequence[high])
return false;
}
return SequenceOfBST(sequence,low,i-1)&&SequenceOfBST(sequence,i,high-1);
}
}