Leetcode Symmetric tree

最新推荐文章于 2019-05-29 13:59:21 发布

proudmore

最新推荐文章于 2019-05-29 13:59:21 发布

阅读量214

点赞数

分类专栏： leetcode leetcode tree

本文链接：https://blog.csdn.net/proudmore/article/details/44098331

版权

leetcode 同时被 2 个专栏收录

146 篇文章 0 订阅

订阅专栏

leetcode tree

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

[code]
递归版本

public class Solution {
    public boolean isSymmetric(TreeNode root) {
        ArrayList<TreeNode> level=new ArrayList<TreeNode>();
        if(root==null)return true;
        else level.add(root);
        return helper(level);
    }

    boolean helper(ArrayList<TreeNode> level)
    {
        if(level.size()==0)return true;
        int i=0, j=level.size()-1;
        while(i<=j)
        {
            TreeNode l1=level.get(i).left, r1=level.get(i).right;
            TreeNode l2=level.get(j).left, r2=level.get(j).right;
            if( (l1==null && r2!=null) || (l1!=null && r2==null)  )return false;
            if( l1!=null && r2!=null && l1.val!=r2.val )return false;
            if( (l2==null && r1!=null) || (l2!=null && r1==null) )return false;
            if( l2!=null && r1!=null && l2.val!=r1.val )return false;
            i++;j--;
        }
        int n=level.size();
        for(i=0;i<n;i++)
        {
            TreeNode node=level.remove(0);
            if(node.left!=null)level.add(node.left);
            if(node.right!=null)level.add(node.right);
        }
        return helper(level);
    }
}