关闭

leetcode 101. Symmetric Tree

标签: leetcode对称二叉树
108人阅读 评论(0) 收藏 举报
分类:

题目

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree is symmetric:

这里写图片描述
But the following is not:

这里写图片描述

/**
 * 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 isSame(root.left,root.right);

    }


    public  boolean isSame(TreeNode left,TreeNode right){

        if(left==null && right==null)
             return true;

        if(left==null && right!=null || left!=null && right==null){
            return false;
        }

        if(left.val!=right.val)
            return false;

        return isSame(left.left,right.right) && isSame(left.right,right.left);

    }
}
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:57880次
    • 积分:1450
    • 等级:
    • 排名:千里之外
    • 原创:87篇
    • 转载:24篇
    • 译文:0篇
    • 评论:3条
    最新评论