力扣-10.19-101

方法一：（递归）

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {

    public static boolean check(TreeNode p,TreeNode q) {
		if(p==null && q==null) {
			return true;
		}
		if(p==null || q==null) {
			return false;
		}
		return p.val==q.val && check(p.left,q.right) && check(p.right, q.left);
	}
    
    public boolean isSymmetric(TreeNode root) {
        return check(root,root);
    }
}

方法二：（迭代）

Queue<TreeNode> queue=new LinkedList<TreeNode>();
		queue.offer(p);
		queue.offer(q);
		
		while(!queue.isEmpty()) {
			p=queue.poll();
			q=queue.poll();
			
			if(p==null && q==null) {
				continue;
			}
			if((p==null || q==null) || (p.val!=q.val)) {
				return false;
			}
			
			queue.offer(p.left);
			queue.offer(q.right);
			
			queue.offer(p.right);
			queue.offer(q.left);
		}
		return true;