【LeetCode】C# 101、Symmetric Tree

最新推荐文章于 2020-04-21 09:51:53 发布

RUN_D

最新推荐文章于 2020-04-21 09:51:53 发布

阅读量355

点赞数

分类专栏： leetcode 文章标签： leetcode c#

本文链接：https://blog.csdn.net/qq_39643935/article/details/78270133

版权

leetcode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

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 {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public bool IsSymmetric(TreeNode root) {
        if(root == null) return true;
        return symt(root.left,root.right);
    }
    public static bool symt(TreeNode l, TreeNode r){
        if(l==null && r==null) return true;
        if(l==null || r==null) return false;
        if(l.val == r.val)
            return symt(l.left,r.right)&&symt(l.right,r.left);
        return false;
    }
}