#leetcode#226. Invert Binary Tree

Invert a binary tree.

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

to

     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;  
    }
};