【LeetCode】101. Symmetric Tree

最新推荐文章于 2020-12-23 16:34:34 发布

柠檬茶有你的气息

最新推荐文章于 2020-12-23 16:34:34 发布

阅读量163

点赞数

本文链接：https://blog.csdn.net/weixin_38687387/article/details/79600712

版权

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

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

But the following [1,2,2,null,3,null,3] is not:

Note:
Bonus points if you could solve it both recursively and iteratively.

代码如下

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

    private boolean isSymmetric(TreeNode left,TreeNode right)
    {
        if(left==null&&right==null)
            return true;
        if(left==null||right==null)
            return false;
        if(left.val==right.val&&isSymmetric(left.left,right.right)&&isSymmetric(left.right,right.left))
            return true;
        return false;
    }
    public boolean isSymmetric(TreeNode root) {
        if(root==null)
            return true;

        if(isSymmetric(root.left,root.right)==true)
            return true;

        return false;

    }


}