names completed

names/names.py

@@ -1,4 +1,6 @@
 import time
+from names_bst import BinarySearchTree
+
 
 start_time = time.time()
 
@@ -11,14 +13,24 @@
 f.close()
 
 duplicates = []
-for name_1 in names_1:
-    for name_2 in names_2:
-        if name_1 == name_2:
-            duplicates.append(name_1)
 
+bst = BinarySearchTree('name')
+# adding names from list names_1 to the bst
+for name in names_1:
+    bst.insert(name)
+# checking all names in list names_2 to see if it exists in the bst. if the bst contains a duplicated name, appended it to the duplicates[] array.
+for name in names_2:
+    if bst.contains(name):
+        duplicates.append(name)
+# for name_1 in names_1:
+#     for name_2 in names_2:
+#         if name_1 == name_2:
+#             duplicates.append(name_1)
+
+## runtime: 0.12141919136047363 seconds NEW ONE ##
 end_time = time.time()
-print (f"{len(duplicates)} duplicates:\n\n{', '.join(duplicates)}\n\n")
-print (f"runtime: {end_time - start_time} seconds")
+print(f"{len(duplicates)} duplicates:\n\n{', '.join(duplicates)}\n\n")
+print(f"runtime: {end_time - start_time} seconds")
 
 # ---------- Stretch Goal -----------
 # Python has built-in tools that allow for a very efficient approach to this problem