/**
* 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 {
//递归方法1, 交换节点的左右子树
//方法的含义为返回交换root左右子树后的root,那么该方法的递归就需要交换root的所有左右子树的左右孩子节点
public TreeNode invertTree(TreeNode root) {
if(root == null){
return null;
}
swapNode(root);
TreeNode left = invertTree(root.left);
TreeNode right = invertTree(root.right);
return root;
}
public void swapNode(TreeNode root){
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
}
}
递归方法2
/**
* 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 {
//常规递归方法,利用void递归方法辅助逆转
public TreeNode invertTree(TreeNode root) {
helpInvert(root);
return root;
}
public void helpInvert(TreeNode root){
if(root == null){
return;
}
helpInvert(root.left);
helpInvert(root.right);
TreeNode temp = root.left;
root.left = root.right;
root.right = temp;
}
}