LC-对称二叉树（JavaScript实现）

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {boolean}
 */
var verifyTree = (p,q) => {
    if(!p && !q) return true;
    if(!p || !q) return false;
    return p.val==q.val && verifyTree(p.left,q.right) && verifyTree(p.right,q.left);
}
var isSymmetric = function(root) {
    return verifyTree(root,root)
};