java代码实现: import java.util.*;
public class Solution {
//递归
public boolean isSymmetric (TreeNode root) {
if(root == null)
return true;
return check(root.left, root.right);
}
public boolean check(TreeNode left, TreeNode right){
if(left == null && right == null)
return true;
if(left == null || right == null)
return false;
return left.val == right.val && check(left.left, right.right) && check(left.right, right.left);
}
//迭代
public boolean isSymmetric (TreeNode root) {
if(root == null)
return true;
Queue queue = new LinkedList();
queue.offer(root.left);
queue.offer(root.right);
while(!queue.isEmpty()){
TreeNode left = queue.poll();
TreeNode right = queue.poll();
if(left == null && right == null)
continue;
if(left == null || right == null || left.val != right.val)
return false;
queue.offer(left.left);
queue.offer(right.right);
queue.offer(left.right);
queue.offer(right.left);
}
return true;
}
}