226. Invert Binary Tree*

226. Invert Binary Tree*

https://leetcode.com/problems/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.

C++ 实现 1

🥺Homebrew 的作者去 Google 面试, 对方出了这道翻转二叉树的题, 然后他没有做出来. Google 说…

突然回忆起这个事件.

先用递归方法做, 翻转左子树, 再翻转右子树, 最后交换根节点的左右子树.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if (!root) return nullptr;
        root->left = invertTree(root->left);
        root->right = invertTree(root->right);
        std::swap(root->left, root->right);
        return root;
    }
};

C++ 实现 2

使用迭代的方法做, 使用队列, 做层序遍历.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if (!root) return nullptr;
        queue<TreeNode*> q;
        q.push(root);
        while (!q.empty()) {
            auto r = q.front();
            q.pop();
            std::swap(r->left, r->right);
            if (r->left) q.push(r->left);
            if (r->right) q.push(r->right);
        }
        return root;
    }
};