Leetcode-标签为Tree 101. Symmetric Tree

最新推荐文章于 2024-09-19 06:01:52 发布

zg1g

最新推荐文章于 2024-09-19 06:01:52 发布

阅读量697

点赞数 2

分类专栏：算法/LeetCode 经典算法，LeetCode题目研究文章标签： leetcode 二叉树对称

本文链接：https://blog.csdn.net/daigualu/article/details/70544774

版权

经典算法，LeetCode题目研究同时被 2 个专栏收录

225 篇文章 18 订阅

订阅专栏

算法/LeetCode

223 篇文章 1 订阅

订阅专栏

原题

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:

题目分析

判断树是否为对称树。反转右子树，然后比较是否等于左子树。

代码实现

        public bool IsSymmetric(TreeNode root)
        {
            if (root == null)
                return true;
            if (root.left == null && root.right == null)
                return true;
            if (root.left == null || root.right == null)
                return false;
            if (root.left.val != root.right.val)
                return false;
            TreeNode invertRight=invertTree(root.right);
            return isSameTree(root.left, invertRight);
        }

        //反转
        private TreeNode invertTree(TreeNode root)
        {
            if (root == null)
                return null;
            var tmp = root.left;
            root.left = root.right;
            root.right = tmp;
            invertTree(root.left);
            invertTree(root.right);
            return root;
        }

        //比较树是否相等
        private bool isSameTree(TreeNode p, TreeNode q)
        {
            if (p == null && q == null) return true;
            if (p == null || q == null) return false;
            return p.val == q.val &&
                isSameTree(p.left, q.left) &&
                isSameTree(p.right, q.right);
        }