Problem:
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
Explanation:
判断一棵树是否对称。
My Thinking:
My Solution:
Optimum Thinking:
- 使用递归,再复制一棵树,对树1的左结点和树2的右结点分别进行递归判断。
- 使用队列,同样复制两棵树,每次将树1的左结点和树2的右结点作为一组,树2的左结点和树1的右结点作为一组加入队列,然后两个两个拿出进行判断。
Optimum Solution:
(1)
class Solution {
public boolean isSymmetric(TreeNode root) {
return isMirror(root, root);
}
public boolean isMirror(TreeNode t1, TreeNode t2) {
if (t1 == null && t2 == null) return true;
if (t1 == null || t2 == null) return false;
if(t1.val == t2.val)
return isMirror(t1.left, t2.right) && isMirror(t1.right, t2.left);
else
return false;
}
}
(2)
class Solution {
public boolean isSymmetric(TreeNode root) {
Queue<TreeNode> q=new LinkedList<>();
q.add(root);
q.add(root);
while(!q.isEmpty()){
TreeNode t1=q.poll();
TreeNode t2=q.poll();
if (t1 == null && t2 == null) continue;
if (t1 == null || t2 == null) return false;
if (t1.val != t2.val)
return false;
q.add(t1.left);
q.add(t2.right);
q.add(t1.right);
q.add(t2.left);
}
return true;
}
}