剑指 Offer 27. 二叉树的镜像 剑指 Offer 28. 对称的二叉树

原题链接

class Solution {
    public TreeNode mirrorTree(TreeNode root) {
        //截止条件
        if(root == null) return null;
        TreeNode tmp = root.left;
        root.left = root.right;
        root.right = tmp;
        //如上交换完之后，开始递归操作
        root.right = mirrorTree(root.right);
        root.left = mirrorTree(root.left);
        return root;
    }
}

原题链接

class Solution {
    public boolean isSymmetric(TreeNode root) {
        if(root == null) return true;
        return isBalance(root.left, root.right);
    }
    //递归函数 作用是判断是否对称
    public boolean isBalance(TreeNode left, TreeNode right){
        //截止条件
        if(left == null && right == null) return true;
        if(left == null || right == null) return false;
        if(left.val != right.val) return false;
        return isBalance(left.left, right.right) && isBalance(left.right, right.left);
    }
}