classSolution{ publicbooleanverifyPostorder(int[] postorder){ return recur(postorder, 0, postorder.length - 1); } booleanrecur(int[] postorder, int i, int j){ if(i >= j) returntrue;//说明子树节点数<=1 int p = i; while(postorder[p] < postorder[j]) p++; int m = p; while(postorder[p] > postorder[j]) p++; return p == j && recur(postorder, i, m - 1) && recur(postorder, m, j - 1); } }