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
Note:
Bonus points if you could solve it both recursively and iteratively.
题目链接:https://leetcode.com/problems/symmetric-tree/description/
题目分析:构造一个DFS方法辅助判断,每次判断左子树的左孩子与右子树的右孩子 和 左子树的右孩子与右子树的左孩子是否相等。击败94.58%
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public boolean isSymmetric(TreeNode root) {
return root == null ? true : DFS(root.left, root.right);
}
public boolean DFS(TreeNode r1, TreeNode r2) {
if (r1 == null || r2 == null) {
return r1 == r2;
}
if (r1.val != r2.val) {
return false;
}
return DFS(r1.left, r2.right) && DFS(r1.right, r2.left);
}
}