offer33专题

剑指offer33.二叉搜索树的后序遍历序列。简单易懂0ms

class Solution {public boolean verifyPostorder(int[] postorder) {return dfs(postorder, 0, postorder.length - 1);}boolean dfs(int[] postorder, int left, int right){if(left >= right) return true;// 搜索树的