LeetCode 226. Invert Binary Tree

问题描述

• 
• 地址

问题分析

• 反转一棵二叉树
  
  • DFS
  • DFS非递归形式
  • BFS

代码实现

• DFS

    public TreeNode invertTree(TreeNode root) {
        if (root == null) {
            return root;
        }
        //反转左子树
        invertTree(root.left);
        //反转右子树
        invertTree(root.right);
        //左右子树交换
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;
        return root;
    }

• DFS非递归形式

    public TreeNode invertTree(TreeNode root) {
        if (root == null) {
            return root;
        }
        Stack<TreeNode> stack = new Stack<>();
        stack.push(root);
        while (! stack.isEmpty()) {
            TreeNode popNode = stack.pop();
            if (popNode.left != null) {
                stack.push(popNode.left);
            }
            if (popNode.right != null) {
                stack.push(popNode.right);
            }
            TreeNode temp = popNode.left;
            popNode.left = popNode.right;
            popNode.right = temp;
        }
        return root;
    }

• BFS

    public TreeNode invertTree(TreeNode root) {
        if (root == null) {
            return root;
        }
        LinkedList<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        while(! queue.isEmpty()) {
            TreeNode popNode = queue.remove();
            if (popNode.left != null) {
                queue.add(popNode.left);
            }
            if (popNode.right != null) {
                queue.add(popNode.right);
            }
            TreeNode temp = popNode.left;
            popNode.left = popNode.right;
            popNode.right = temp;
        }
        return root;
    }