Leetcode Symmetric Tree 101

最新推荐文章于 2020-12-28 22:34:43 发布

不迷信_只迷人

最新推荐文章于 2020-12-28 22:34:43 发布

阅读量404

点赞数

分类专栏： java 算法练习文章标签： leetcode

本文链接：https://blog.csdn.net/honeyaya/article/details/51228482

版权

算法练习同时被 2 个专栏收录

141 篇文章 0 订阅

订阅专栏

java

26 篇文章 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:

/ \
2 2
/ \ / \
3 4 4 3
But the following is not:
1
/ \
2 2
\ \
3 3

/** 

 * 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; 

        else{ 

            return judge(root.left , root.right); 

        } 

    } 

    public boolean judge(TreeNode lchild,TreeNode rchild){ 

        if(lchild!=null && rchild!=null){ 

            return (lchild.val==rchild.val) && judge(lchild.left , rchild.right) && judge(lchild.right , rchild.left); 

        } 

        else if(lchild==null && rchild==null){ 

            return true; 

        } 

        else return false; 

    } 

}