標題【編程題】二叉搜索樹的後序遍歷序列(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);
}
}