leetcode[101]----对称二叉树

 解释代码

 js 代码

/*
 * @lc app=leetcode.cn id=101 lang=javascript
 *
 * [101] 对称二叉树
 */

// @lc code=start

//  * 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 isSymmetric = function(root) {

    if(!root){
        return true
    }
   return isSame(root.left,root.right)
};
var isSame=function(left,right){
    if((left && !right)||(!left && right) ||(left&& right && left.val!==right.val)){
        return false
    }
    if(left && right){
        return isSame(left.left,right.right) && isSame(left.right,right.left)
    }
    return true
}
// @lc code=end