Leetcode学习笔记:#101. 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
实现:
public boolean isSymmetric(TreeNode root){
return root == null || isSymmetricHelper(rrot.left, root.right);
}
public boolean isSymmetricHelper(TreeNode left, TreeNode right){
if(left == null || right == null)
return left==right;
if(left.val != right.val)
return false;
return isSymmeticHelper(left.left, right.right) && isSymmetricHelper(left.right, right.left);
}
思路:
递归判断左节点是否等于右节点