首页 > 代码库 > [LeetCode]101 Symmetric Tree
[LeetCode]101 Symmetric Tree
https://oj.leetcode.com/problems/symmetric-tree/
http://blog.csdn.net/linhuanmars/article/details/23072829
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isSymmetric(TreeNode root)
{
if (root == null || (root.left == null && root.right == null))
return true;
return help(root.left, root.right);
}
// DFS
private boolean help(TreeNode l, TreeNode r)
{
if (l == null && r == null)
return true;
if (l == null && r != null)
return false;
if (l != null && r == null)
return false;
return (l.val == r.val) && help(l.left, r.right) && help(l.right, r.left);
}
}[LeetCode]101 Symmetric Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。