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:
1 2 3
1 2 3
Output: true

Example 2:

Input:
1 2
1 null 2
Output: false

Constraints:

• The number of nodes in both trees is in the range [0, 100]
• -10⁴ ≤ Node.val ≤ 10⁴

Input format: Two lines, each with BFS level-order of a tree (null for missing nodes).

Output format: true or false.