Same Tree

Easy

Given the roots of two binary trees p and q, return true if they are structurally identical and the nodes have the same values.

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

Constraints

• 0 <= number of nodes <= 100
• -10^4 <= Node.val <= 10^4