Same Tree

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

        1           1
       / \         / \
      2   3       2   3

Inputp = [1,2,3], q = [1,2,3]

Outputtrue

Both trees have the same structure and the same node values.

Example 2

        1           1
       /             \
      2               2

Inputp = [1,2], q = [1,null,2]

Outputfalse

The trees contain the same values but have different structures, so they are not the same.

Constraints