题解 | #二叉搜索树的后序遍历序列#

//找到true的条件，即找到max界限
//正确的截取子树
//正确判断true出口
function VerifySquenceOfBST(sequence)
{
    // write code here
    if(sequence.length==0){return false}
    else{
        return VerifyS(sequence)
    }
}
function VerifyS(sequence){
    if(sequence.length==0){return true}
    let head=sequence[sequence.length-1]
    let i=0
    while(sequence[i]<head){
        i++
    }
    let left=i
    while(sequence[i]>head){
        i++
    }
    if(i<sequence.length-1){
        return false
    }
    else{
        let arr=sequence.slice(0,left)
        let arr1=sequence.slice(left,sequence.length-1)
        return VerifyS(arr)&&VerifyS(arr1)
    }
}
module.exports = {
    VerifySquenceOfBST : VerifySquenceOfBST
};