Invert Binary Tree

Invert a binary tree.

Example:

Input:

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

Output:

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

方法一：迭代法

/**
 * 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) {
        queue<TreeNode*> tree_queue;
        if (root == NULL)
            return root;
        tree_queue.push(root);
        while(tree_queue.size() > 0){
            TreeNode * pNode = tree_queue.front();
            tree_queue.pop();
            TreeNode * pLeft = pNode->left;
            pNode->left = pNode->right;
            pNode->right = pLeft;
            if (pNode->left)
                tree_queue.push(pNode->left);
            if (pNode->right)
                tree_queue.push(pNode->right);
        }
        return root;
    }*/
};

方法二：递归法

TreeNode* invertTree(TreeNode* root)
    {
        if(root==NULL)
            return NULL;
        TreeNode * ptmpNode = root->left;
        root->left = invertTree(root->right);
        root->right = invertTree(ptmpNode);
        return root;
    }