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.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null){
return null;
}
TreeNode temp=root.left;
root.left=invertTree(root.right);
root.right=invertTree(temp);
return root;
}
}
迭代的实现思路也不麻烦,主要是用一个队列在过程中存储要进行操作的节点(先进先出),将root、交换后的左右节点依次压入,最后返回的也是原来二叉树的镜像。
public class Solution {
public TreeNode invertTree(TreeNode root) {
if(root == null) return root;
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.offer(root);//同add一样都是插入数据,区别是offer越界返回false,add会抛出异常
while(!queue.isEmpty()){
TreeNode node = queue.poll();//同remove一样都是删除数据,区别是poll异常返回null,remove抛出异常
TreeNode tmp = node.left;
node.left = node.right;
node.right = tmp;
if(node.left != null) queue.offer(node.left);
if(node.right != null) queue.offer(node.right);
}
return root;
}
}