• Home
• com.github.javadev
• leetcode-in-java11
• 1.4
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0001_0100.s0100_same_tree.readme.md Maven / Gradle / Ivy

100\. Same Tree

Easy

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:**

![](https://assets.leetcode.com/uploads/2020/12/20/ex1.jpg)

**Input:** p = \[1,2,3\], q = \[1,2,3\]

**Output:** true 

**Example 2:**

![](https://assets.leetcode.com/uploads/2020/12/20/ex2.jpg)

**Input:** p = \[1,2\], q = \[1,null,2\]

**Output:** false 

**Example 3:**

![](https://assets.leetcode.com/uploads/2020/12/20/ex3.jpg)

**Input:** p = \[1,2,1\], q = \[1,1,2\]

**Output:** false 

**Constraints:**

*   The number of nodes in both trees is in the range `[0, 100]`.
*   -104 <= Node.val <= 104