力扣刷题101.对称二叉树

可以考虑用递归来实现，用两个指针的方法来遍历这棵树，p指针和q指针一开始都指向这棵树的头部，然后p左移时，q就右移；p右移时，q就左移。每次判断p结点的值和q结点的值是否相等。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean isSymmetric(TreeNode root) {
        return check(root,root);
    }
    public 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);
    }
}