LeetCode 101 Symmetric Tree

 

1.

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

 

这么写看着更舒服。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution 
{
    public boolean isSymmetric(TreeNode root) 
    {
        if(root == null)
            return true;
        
        return isSymmetric(root.left, root.right);
    }
    
    public boolean isSymmetric(TreeNode left, TreeNode right)
    {
        // if two nodes are null
        if(left == null && right == null)
            return true;
        // is one node is null, another is another
        if(left == null || right == null)
            return false;
        // if two nodes value are not same
        if(left.val != right.val)
            return false;
        
        return isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left);
        
    }
}