首页 > 代码库 > Symmetric Tree，对称树
Symmetric Tree，对称树
问题描述：
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:
1 / 2 2 / \ / 3 4 4 3
But the following [1,2,2,null,3,null,3] is not:
1 / 2 2 \ 3 3
算法分析：和same tree比较像，都可以用递归方法来解决。
public class SymmeticTree { public boolean isSymmetric(TreeNode root) { if (root == null) { return true; } return isSymmetric(root.left, root.right); } public boolean isSymmetric(TreeNode left, TreeNode right) { if (left == null && right == null) { return true; } else if ((left == null && right != null) || (right == null && left != null) || (left.val != right.val)) { return false; } else { return isSymmetric(left.left, right.right) && isSymmetric(left.right, right.left); } }}
Symmetric Tree，对称树
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。