From 57075bd388ce88eb9e4b8cc2e1ea629ecde01247 Mon Sep 17 00:00:00 2001
From: marina <138340846+bt3gl-cryptographer@users.noreply.github.com>
Date: Thu, 3 Aug 2023 13:16:07 -0700
Subject: [PATCH] Update and rename find_duplicate_subtrees.py to
 bt_find_duplicate_subtrees.py

---
 ...cate_subtrees.py => bt_find_duplicate_subtrees.py} | 11 ++---------
 1 file changed, 2 insertions(+), 9 deletions(-)
 rename trees/{find_duplicate_subtrees.py => bt_find_duplicate_subtrees.py} (72%)

diff --git a/trees/find_duplicate_subtrees.py b/trees/bt_find_duplicate_subtrees.py
similarity index 72%
rename from trees/find_duplicate_subtrees.py
rename to trees/bt_find_duplicate_subtrees.py
index dc6ac78..b26d65f 100644
--- a/trees/find_duplicate_subtrees.py
+++ b/trees/bt_find_duplicate_subtrees.py
@@ -1,18 +1,11 @@
 #!/usr/bin/env python3
 # -*- coding: utf-8 -*-
 # author: bt3gl
-#
+
 # Given the root of a binary tree, return all duplicate subtrees.
-#
-# 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
 
 
-def find_duplicates(root: Optional[TreeNode]) -> List[Optional[TreeNode]]:
+def find_duplicates(root: Optional[Node]) -> list[Optional[Node]]:
 
         result = []
         counter = {}