leetcode-----101. 对称二叉树

• 链接：https://leetcode-cn.com/problems/symmetric-tree/

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

    public boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null || q== null) return p == q;
        return (p.val == q.val) && isSameTree(p.left, q.right) && isSameTree(p.right, q.left);
    }
}

leetcode-----101. 对称二叉树

原文：https://www.cnblogs.com/clown9804/p/12639049.html