【LeetCode】 Invert Binary Tree(二叉树反转 递归、非递归实现)

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.

递归交换左右子树

[CODE]

[java]  view plain  copy

1. /** 
2.  * Definition for a binary tree node. 
3.  * public class TreeNode { 
4.  *     int val; 
5.  *     TreeNode left; 
6.  *     TreeNode right; 
7.  *     TreeNode(int x) { val = x; } 
8.  * } 
9.  */  
10. public class Solution {  
11.     public TreeNode invertTree(TreeNode root) {  
12.         if(root==null) return null;  
13.           
14.         TreeNode temp  = root.left;  
15.         root.left = root.right;  
16.         root.right = temp;  
17.           
18.         invertTree(root.left);  
19.         invertTree(root.right);  
20.           
21.         return root;      
22.     }  
23.       
24. }  

非递归算法：

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