0100: Same Tree

Problem Statement

Given the roots of two binary trees p and q, 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: p = [1,2,3], q = [1,2,3]
Output: true

Example 2:

Input: p = [1,2], q = [1,null,2]
Output: false

Example 3:

Input: p = [1,2,1], q = [1,1,2]
Output: false

Constraints:

  • The number of nodes in both trees is in the range [0, 100].
  • -104 <= Node.val <= 104

Code Solution

class Solution:
    def isSameTree(self, p, q):
        def rec(n1, n2):
            if not n1 and not n2: return True
            if n1 and not n2: return False
            if n2 and not n1: return False
            return n1.val == n2.val and rec(n1.left, n2.left) and rec(n1.right, n2.right)
        return rec(p, q)