Leetcode Series. No 100: 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:

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

As always, follow the comments for each line.

In this solution, the time complexity is O(p + q) where “p” and “q” are the nodes of the tree. And space complexity is O(1).

From my comments on the code, if you have any questions or comments, feel free to reach out.