Leetcode - 对称二叉树

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public bool IsSymmetric(TreeNode root) {
        return fun(root,root);
    }

    private bool fun(TreeNode root1,TreeNode root2)
    {
        if(root1==null&&root2==null)
        {
            return true;
        }
        else if(root1==null||root2==null||root1.val!=root2.val)
        {
            return false;
        }
        else
        {
            bool temp1=fun(root1.left,root2.right);
            bool temp2=fun(root1.right,root2.left);
            return temp1&&temp2;
        }
    }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public bool IsSymmetric(TreeNode root) {
        
        if(root == null){
            return true;
        }

        TreeNode left = root.left;
        TreeNode right = root.right;
        return IsMirror(left,right);
        
    }

    public bool IsMirror(TreeNode node1,TreeNode node2) {
        if(node1 == null && node2 == null) return true;
        if(node1 == null || node2 == null) return false;
        if(node1.val == node2.val) {
            return IsMirror(node1.left,node2.right) && IsMirror(node1.right,node2.left);
        }else{
            return false;
        }

    }
}