Given the roots of two binary trees, p and q, write a function to check whether or not they are the same. Two binary trees are considered the same if they’re structurally identical and the nodes have the same value.

Constraints:

• The number of nodes in the tree is in the range $[0, 100]$

• $-10^4 \leq$ node.data $\leq 10^4$