Same Tree (medium)

## Problem Statement

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 met following two conditions:

- Both tree are structurally identical.
- Each corresponding node on both the trees have the same value.

**Example 1**:

Given the following two binary trees:

**Output**: true

**Explanation**: Both trees are structurally identical and have same values.

**Example 2**:

Given the following two binary trees:

**Output**: false

**Explanation**: Trees are structurally different.

**Example 3**:

Given the following two binary trees:

**Output**: false

**Explanation**: Corresponding nodes have different value ( 4 & 9 ).

## Try it yourself

Try solving this question here:

NaN

NaN

LOADING....

. . .

## Time and Space Complexities

Everything has the same complexity as the previous solution.