反转二叉树

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.

非递归算法：

1、交换根节点的左右子节点

2、交换第二层每个节点的左右子节点

....

这个与二叉树层次遍历类似，代码如下：

[cpp]  view plain  copy

 print ?

1. TreeNode* invertTree2(TreeNode* root) {  
2.         queue<TreeNode*> tree_queue;  
3.         if (root == NULL)  
4.             return root;  
5.         tree_queue.push(root);  
6.         while(tree_queue.size() > 0){  
7.             TreeNode * pNode = tree_queue.front();  
8.             tree_queue.pop();  
9.             TreeNode * pLeft = pNode->left;  
10.             pNode->left = pNode->right;  
11.             pNode->right = pLeft;  
12.             if (pNode->left)  
13.                 tree_queue.push(pNode->left);  
14.             if (pNode->right)  
15.                 tree_queue.push(pNode->right);  
16.         }  
17.         return root;  
18.     }  

递归算法：

1、交换根节点的左右子树。

2、对左右子树分别执行递归反转 。

代码如下：

[cpp]  view plain  copy

 print ?

1.  TreeNode* invertTree(TreeNode* root) {  
2. f(root==NULL)  
3.     return NULL;  
4. TreeNode * ptmpNode = root->left;  
5. root->left = invertTree(root->right);  
6. root->right = invertTree(ptmpNode);  
7. return root;  
8.   }