same-tree

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the roots of two binary trees <code>p</code> and <code>q</code>, 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.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/20/ex1.jpg" style="width: 622px; height: 182px;" />
<pre>
Input: p = [1,2,3], q = [1,2,3]
Output: true
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/20/ex2.jpg" style="width: 382px; height: 182px;" />
<pre>
Input: p = [1,2], q = [1,null,2]
Output: false
</pre>

Example 3:
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/20/ex3.jpg" style="width: 622px; height: 182px;" />
<pre>
Input: p = [1,2,1], q = [1,1,2]
Output: false
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in both trees is in the range <code>[0, 100]</code>.</li>
	<li><code>-104 &lt;= Node.val &lt;= 104</code></li>
</ul>

isSameTree

Same Tree

Tree

Depth-First Search

Breadth-First Search

Binary Tree

给你两棵二叉树的根节点 <code>p</code> 和 <code>q</code> ，编写一个函数来检验这两棵树是否相同。

如果两个树在结构上相同，并且节点具有相同的值，则认为它们是相同的。

 

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/20/ex1.jpg" style="width: 622px; height: 182px;" />
<pre>
输入：p = [1,2,3], q = [1,2,3]
输出：true
</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/20/ex2.jpg" style="width: 382px; height: 182px;" />
<pre>
输入：p = [1,2], q = [1,null,2]
输出：false
</pre>

示例 3：
<img alt="" src="https://assets.leetcode.com/uploads/2020/12/20/ex3.jpg" style="width: 622px; height: 182px;" />
<pre>
输入：p = [1,2,1], q = [1,1,2]
输出：false
</pre>

 

提示：

<ul>
	<li>两棵树上的节点数目都在范围 <code>[0, 100]</code> 内</li>
	<li><code>-104 <= Node.val <= 104</code></li>
</ul>