Same Tree

Description

Given two binary trees, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Example 1:

Input:     1         1
          / \       / \
         2   3     2   3
    [1,2,3],   [1,2,3]

Output: true

Example 2:

Input:     1         1
          /           \
         2             2
    [1,2],     [1,null,2]

Output: false

Example 3:

Input:     1         1
          / \       / \
         2   1     1   2
    [1,2,1],   [1,1,2]

Output: false

Solution(javascript)

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} p
 * @param {TreeNode} q
 * @return {boolean}
 */
const isSameTree = function (p, q) {
  if ((p && !q) || (!p && q)) {
    return false
  }
  if (!p && !q) {
    return true
  }
  const leftSame = isSameTree(p.left, q.left)
  const rightSame = isSameTree(p.right, q.right)
  return leftSame && rightSame && (p.val === q.val)
}