MediumNo. 0652
Find Duplicate Subtrees — LeetCode 652 Python Solution
- Pattern
- Tree Traversal
- Topics
- Tree, Depth-First Search, Hash Table, Binary Tree
- Reading time
- 4 min
- Source
- leetcode.com
The problem
Given the root 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.
Example
- Input
- root = [1,2,3,4,null,2,4,null,null,4]
- Output
- [[2,4],[4]]
Python solution
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def findDuplicateSubtrees(
self, root: Optional[TreeNode]
) -> List[Optional[TreeNode]]:
def dfs(root):
if root is None:
return '#'
v = f'{root.val},{dfs(root.left)},{dfs(root.right)}'
counter[v] += 1
if counter[v] == 2:
ans.append(root)
return v
ans = []
counter = Counter()
dfs(root)
return ansComplexity
- Time
- O(n)
- Space · auxiliary
- O(n)
Pattern: Tree Traversal
Choose the order — preorder, inorder, postorder, level — and the problem solves itself. LeetCode 652. Find Duplicate Subtrees is filed here because LeetCode tags it Tree and Binary Tree, which is the vocabulary this hub collects.
The tree traversal guide has the Python template for the pattern and the 225 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0653 | Two Sum IV - Input is a BST | Easy |
| 0508 | Most Frequent Subtree Sum | Medium |
| 0863 | All Nodes Distance K in Binary Tree | Medium |
| 0865 | Smallest Subtree with all the Deepest Nodes | Medium |
| 0987 | Vertical Order Traversal of a Binary Tree | Hard |
| 1110 | Delete Nodes And Return Forest | Medium |
Frequently asked questions
- How hard is LeetCode 652. Find Duplicate Subtrees?
LeetCode 652. Find Duplicate Subtrees is rated Medium on LeetCode.
- What is the time complexity of LeetCode 652. Find Duplicate Subtrees?
The Python solution on this page runs in O(n).
- What is the space complexity of LeetCode 652. Find Duplicate Subtrees?
The Python solution on this page uses O(n) auxiliary space.
- What topics does LeetCode 652. Find Duplicate Subtrees cover?
LeetCode 652. Find Duplicate Subtrees is tagged Tree, Depth-First Search, Hash Table and Binary Tree on LeetCode.