subtree-of-another-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>root</code> and <code>subRoot</code>, return <code>true</code> if there is a subtree of <code>root</code> with the same structure and node values of<code> subRoot</code> and <code>false</code> otherwise.

A subtree of a binary tree <code>tree</code> is a tree that consists of a node in <code>tree</code> and all of this node&#39;s descendants. The tree <code>tree</code> could also be considered as a subtree of itself.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/28/subtree1-tree.jpg" style="width: 532px; height: 400px;" />
<pre>
Input: root = [3,4,5,1,2], subRoot = [4,1,2]
Output: true
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/28/subtree2-tree.jpg" style="width: 502px; height: 458px;" />
<pre>
Input: root = [3,4,5,1,2,null,null,null,null,0], subRoot = [4,1,2]
Output: false
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the <code>root</code> tree is in the range <code>[1, 2000]</code>.</li>
	<li>The number of nodes in the <code>subRoot</code> tree is in the range <code>[1, 1000]</code>.</li>
	<li><code>-104 &lt;= root.val &lt;= 104</code></li>
	<li><code>-104 &lt;= subRoot.val &lt;= 104</code></li>
</ul>

isSubtree

Subtree of Another Tree

Count Univalue Subtrees

count-univalue-subtrees

统计同值子树

Most Frequent Subtree Sum

most-frequent-subtree-sum

出现次数最多的子树元素和

Tree

Depth-First Search

Binary Tree

String Matching

Hash Function

<div class="original__bRMd">
<div>
给你两棵二叉树 <code>root</code> 和 <code>subRoot</code> 。检验 <code>root</code> 中是否包含和 <code>subRoot</code> 具有相同结构和节点值的子树。如果存在，返回 <code>true</code> ；否则，返回 <code>false</code> 。

二叉树 <code>tree</code> 的一棵子树包括 <code>tree</code> 的某个节点和这个节点的所有后代节点。<code>tree</code> 也可以看做它自身的一棵子树。

&nbsp;

示例 1：
<img alt="" src="https://pic.leetcode.cn/1724998676-cATjhe-image.png" style="width: 532px; height: 400px;" />
<pre>
输入：root = [3,4,5,1,2], subRoot = [4,1,2]
输出：true
</pre>

示例 2：
<img alt="" src="https://pic.leetcode.cn/1724998698-sEJWnq-image.png" style="width: 502px; height: 458px;" />
<pre>
输入：root = [3,4,5,1,2,null,null,null,null,0], subRoot = [4,1,2]
输出：false
</pre>

&nbsp;

提示：

<ul>
	<li><code>root</code> 树上的节点数量范围是 <code>[1, 2000]</code></li>
	<li><code>subRoot</code> 树上的节点数量范围是 <code>[1, 1000]</code></li>
	<li><code>-104 &lt;= root.val &lt;= 104</code></li>
	<li><code>-104 &lt;= subRoot.val &lt;= 104</code></li>
</ul>
</div>
</div>