find-duplicate-subtrees

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 <code>root</code>&nbsp;of a binary tree, return all duplicate subtrees.

For each kind of duplicate subtrees, you only need to return the root node of any one of them.

Two trees are duplicate if they have the same structure with the same node values.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/16/e1.jpg" style="width: 450px; height: 354px;" />
<pre>
Input: root = [1,2,3,4,null,2,4,null,null,4]
Output: [[2,4],[4]]
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/16/e2.jpg" style="width: 321px; height: 201px;" />
<pre>
Input: root = [2,1,1]
Output: [[1]]
</pre>

Example 3:
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/16/e33.jpg" style="width: 450px; height: 303px;" />
<pre>
Input: root = [2,2,2,3,null,3,null]
Output: [[2,3],[3]]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of the nodes in the tree will be in the range <code>[1, 5000]</code></li>
	<li><code>-200 &lt;= Node.val &lt;= 200</code></li>
</ul>

findDuplicateSubtrees

Find Duplicate Subtrees

Serialize and Deserialize Binary Tree

serialize-and-deserialize-binary-tree

二叉树的序列化与反序列化

Serialize and Deserialize BST

serialize-and-deserialize-bst

序列化和反序列化二叉搜索树

Construct String from Binary Tree

construct-string-from-binary-tree

根据二叉树创建字符串

Delete Duplicate Folders in System

delete-duplicate-folders-in-system

删除系统中的重复文件夹

Tree

Depth-First Search

Hash Table

Binary Tree

给你一棵二叉树的根节点 <code>root</code> ，返回所有 重复的子树 。

对于同一类的重复子树，你只需要返回其中任意 一棵 的根结点即可。

如果两棵树具有 相同的结构 和 相同的结点值 ，则认为二者是 重复 的。

&nbsp;

示例 1：

<img alt="" src="https://assets.leetcode.com/uploads/2020/08/16/e1.jpg" style="height: 236px; width: 300px;" />

<pre>
输入：root = [1,2,3,4,null,2,4,null,null,4]
输出：[[2,4],[4]]</pre>

示例 2：

<img alt="" src="https://assets.leetcode.com/uploads/2020/08/16/e2.jpg" style="height: 125px; width: 200px;" />

<pre>
输入：root = [2,1,1]
输出：[[1]]</pre>

示例 3：

<img alt="" src="https://assets.leetcode.com/uploads/2020/08/16/e33.jpg" style="height: 202px; width: 300px;" />

<pre>
输入：root = [2,2,2,3,null,3,null]
输出：[[2,3],[3]]</pre>

&nbsp;

提示：

<ul>
	<li>树中的结点数在 <code>[1, 5000]</code> 范围内。</li>
	<li><code>-200 &lt;= Node.val &lt;= 200</code></li>
</ul>