首发于 语雀@blueju

    https://leetcode-cn.com/problems/same-tree/

    1. /**
    2.  * Definition for a binary tree node.
    3.  * function TreeNode(val, left, right) {
    4.  *     this.val = (val===undefined ? 0 : val)
    5.  *     this.left = (left===undefined ? null : left)
    6.  *     this.right = (right===undefined ? null : right)
    7.  * }
    8.  */
    9. /**
    10.  * @param {TreeNode} p
    11.  * @param {TreeNode} q
    12.  * @return {boolean}
    13.  */
    14. var isSameTree = function (p, q) {
    15.     if (p === null && q === null) {
    16.         return true
    17.     }
    18.     if (p === null || q === null) {
    19.         return false
    20.     }
    21.     if (p.val !== q.val) {
    22.         return false
    23.     }
    24.     return isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
    25. };