Leetcode226. Invert Binary Tree

Leetcode226. Invert Binary Tree、

Invert a binary tree.

Example:

Input:

     4
   /   \
  2     7
 / \   / \
1   3 6   9
Output:

     4
   /   \
  7     2
 / \   / \
9   6 3   1

Trivia:
This problem was inspired by this original tweet by Max Howell:

Google: 90% of our engineers use the software you wrote (Homebrew), but you can’t invert a binary tree on a whiteboard so f*** off.

递归

public TreeNode invertTree(TreeNode root) {
    if (root == null) {
        return root;
    }

    TreeNode temp = root.left;
    root.left = root.right;
    root.right = temp;

    invertTree(root.left);
    invertTree(root.right);
    return root;
}

DFS 栈

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

        stack.push(cur.right);
        stack.push(cur.left);
    }
    return root;
}

BFS 队列

public TreeNode invertTree(TreeNode root) {
    Queue<TreeNode> queue = new LinkedList<>();
    queue.offer(root);
    while (!queue.isEmpty()) {
        TreeNode cur = queue.poll();
        if (cur == null) {
            continue;
        }
        TreeNode temp = cur.left;
        cur.left = cur.right;
        cur.right = temp;

        queue.offer(cur.left);
        queue.offer(cur.right);
    }
    return root;
}