LeetCode OJ 226. Invert Binary Tree

LeetCode OJ 226. Invert Binary Tree

---

Description

Invert a binary tree.

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

to

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

方法一

Recursion: 递归，每一次翻转左右子树。这种方法要每次保存左右子树的根节点，然后再把翻转的左右子树根节点分别赋值给父节点的右子节点和左子节点。

代码

/**
 * 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 root;
        TreeNode *l, *r;
        l = invertTree(root->left);
        r = invertTree(root->right);
        root->left = r;
        root->right = l;
        return root;
    }
};

方法二

遍历（queue实现）: 对于每一个节点，都进行遍历，并且交换该节点的左右子节点。

代码

个人github代码链接

/**
 * 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 root;

        queue<TreeNode *> q;
        q.push(root);
        while(!q.empty()){
            TreeNode *node = q.front();
            q.pop();
            TreeNode * temp = node->left;
            node->left = node->right;
            node->right = temp;
            if(node->left)  q.push(node->left);
            if(node->right) q.push(node->right);
        }
        return root;
    }
};