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

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

题目描述

[code]public class Solution {
    public boolean VerifySquenceOfBST(int [] sequence) {

      return  VerifySquenceOfBST( sequence,0,sequence.length-1);

    }
     public boolean VerifySquenceOfBST(int [] sequence,int st,int end) {

        if(st>end){
            return false;
        }
        int root=sequence[end];
        int temp=end;
        for(int j=st;j<end;j++){
            if(sequence[j]>root)
            {
                temp=j;
                break;
            }
        }
        for(int k=temp;k<end;k++){
             if(sequence[k]<root)
            {
                return false;
            }
        }

        boolean left=true;
        if(temp>st)
        left= VerifySquenceOfBST(sequence,0,temp-1);

        boolean right=true;
        if(temp<end)
        right= VerifySquenceOfBST(sequence,temp,end-1);

        return (left&&right);

    }
}