leetcode: (226) Invert Binary Tree

【Question】

Invert a binary tree.

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

to

     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 fuck off.

方法一：可以采用递归的方法，让每个节点的左右孩子交换。

/**
 * 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* invertTree1(TreeNode* root) {
        TreeNode *cur,*p,*q,*temp;
        cur=root;
        if(cur!=NULL)
        {
            p=cur->left;
            q=cur->right;
            cur->left=invertTree1(q);
            cur->right=invertTree1(p);
        }
        return root;
    }
};

方法二：采用层序遍历的方式，让每个节点的左右孩子交换

TreeNode* invertTree2(TreeNode* root) {  
        queue<TreeNode*> TreeQue;  
        if (root == NULL)  return root;  
        TreeQue.push(root);  
        while(!TreeQue.empty()){  
            TreeNode * cur = tree_queue.front();  
            TreeQue.pop();  
            TreeNode * LChild = cur->left;  
            cur->left = cur->right;  
            cur->right = LChild;  
            if (cur->left)  
                TreeQue.push(cur->left);  
            if (cur->right)  
                TreeQue.push(cur->right);  
        }  
        return root;  
    }