JAVA版本
解法一:递归版,这里使用前序或者后序的递归都可以实现,如果使用中序的递归,需要注意结点的交换位置。
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) {
return null;
}
Swap(root);
invertTree(root.left);
invertTree(root.right);
return root;
}
public void Swap(TreeNode root){
TreeNode temp= root.left;
root.left = root.right;
root.right = temp;
}
}
解法二:使用层次遍历的方法来交换结点。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode invertTree(TreeNode root) {
if (root == null) {
return null;
}
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
while(!queue.isEmpty()){
int length = queue.size();
while(length >0){
TreeNode temp = queue.poll();
Swap(temp);
if (temp.left != null) queue.add(temp.left);
if (temp.right != null) queue.add(temp.right);
length--;
}
}
return root;
}
public void Swap(TreeNode root){
TreeNode temp= root.left;
root.left = root.right;
root.right = temp;
}
}