same-tree

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

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>

Mar	APR	Jun
	14
2024	2025	2026