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

 1 public class Solution {
 2     public boolean VerifySquenceOfBST(int [] sequence) {
 3         if(sequence.length==0)
 4             return false;
 5         return isBST(sequence,0,sequence.length-1);
 6     }
 7     
 8     /*给出二叉树的范围判断是否为二叉搜索树*/
 9     public boolean isBST(int[] sequence,int start,int end){
10         if(end<=start)
11             return true;
12         int i = start;
13         for(;i<end;i++){
14             if(sequence[i]>sequence[end])
15                 break;
16         }
17         
18         for(int j=i;j<end;j++){
19             if(sequence[j]<sequence[end])
20                 return false;
21         }
22         return isBST(sequence,start,i-1)&&isBST(sequence,i,end-1);
23     }
24 }