算法分析与设计作业

算法分析与设计作业题
作业来源

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

class Solution {
    public boolean isSymmetric(TreeNode root) {
        if(root == null){return true; }
        return isMirror(root.left, root.right);
      
    }
    
    public boolean isMirror(TreeNode left, TreeNode right){
        if(left == null && right == null) {
            return true;}
        else if((left == null && right != null) || 
            (left != null && right == null) ||
            (left.val != right.val)  ){
            return false;
        }else{
            return isMirror(left.left, right.right) && isMirror(left.right, right.left) ;
            
        }        
    }
}