算法随笔（六）

层序遍历二叉树

 public int[] levelOrder(TreeNode root) {
        if(root == null) return new int[0];
        Queue<TreeNode> queue = new LinkedList();
        List<Integer> list = new ArrayList();
        queue.add(root);
        while(!queue.isEmpty()){
            TreeNode node = queue.poll();
            list.add(node.val);
            if(node.left != null){
                queue.add(node.left);
            }
            if(node.right != null){
                queue.add(node.right);
            }
        }
        int[] res = new int[list.size()];
        for(int i = 0;i<list.size();i++){
            res[i] = list.get(i);
        }
        return res;
    }

镜像翻转

    public TreeNode mirrorTree(TreeNode root) {
        if(root == null || (root.left == null && root.right == null)){
            return root;
        }
        TreeNode temp = mirrorTree(root.left);
        root.left = mirrorTree(root.right);
        root.right = temp;
        return root;
    }

判断二叉搜索树的后序遍历

 public boolean verifyPostorder(int[] postorder) {
       return isLRD(postorder,0,postorder.length-1);
    }

    private boolean isLRD(int[] postorder,int left,int right){
        if(left>=right){
            return true;
        }
        int index = left;
        while(postorder[right]>postorder[index]){
            index++;
        }
        int mid = index;
        while(postorder[right]<postorder[index]){
            index++;
        }
        return index == right && isLRD(postorder,left,mid-1) && isLRD(postorder,mid,right-1);
    }