someday I'll learn how to import modules in python; added BST class to names.py

Author: abravebee

names/binary_search.py

@@ -0,0 +1,76 @@
+class BinarySearchTree:
+    def __init__(self, value):
+        self.value = value
+        self.left = None
+        self.right = None
+
+    def insert(self, value):
+        if value < self.value:
+            if not self.left:
+                self.left = BinarySearchTree(value)
+            else:
+                self.left.insert(value)
+
+        elif value >= self.value:
+            if not self.right:
+                self.right = BinarySearchTree(value)
+            else:
+                self.right.insert(value)
+        pass
+
+# searches the binary search tree for the input value, returning a boolean indicating whether the value exists in the tree or not.
+    def contains(self, target):
+        # compare target to root
+        if target == self.value:
+            print(f"target {target} == self.value {self.value}")
+            return True
+        # if it's smaller, check left side
+        elif target < self.value:
+            print(f"target {target} < self.value {self.value}")
+            # first check that there is a left side; if not, return False
+            if not self.left:
+                print("no self.left")
+                return False
+            # else, if it doesn't match the left side, call contains on left side with same target
+            elif target != self.left:
+                print(f"target {target} != self.left {self.left}")
+                return self.left.contains(target)
+            else:
+                print(f"target {target} == self.left {self.left}")
+                return True
+        # else, check right side
+        elif target > self.value:
+            print(f"target {target} > self.value {self.value}")
+            # first check that there is a right side; if not, return False
+            if not self.right:
+                print("no self.right")
+                return False
+            # else, if it doesn't match the right side, call contains on right side with same target
+            elif target != self.right:
+                print(f"target {target} != self.right {self.right}")
+                return self.right.contains(target)
+            else:
+                print(f"target {target} == self.right {self.right}")
+                return True            
+        pass
+
+# returns the maximum value in the binary search tree.
+    def get_max(self):
+        # find rightmost node
+        max = self
+        while max.right:
+            max = max.right
+        return max.value
+        pass
+
+# performs a traversal of _every_ node in the tree, executing the passed-in callback function on each tree node value. 
+# There is a myriad of ways to perform tree traversal; in this case any of them should work. 
+    def for_each(self, cb):
+        Inorder
+        if self:
+            if self.left:
+                self.left.for_each(cb)
+            cb(self.value)
+            if self.right:
+                self.right.for_each(cb)
+

names/names.py

@@ -10,11 +10,70 @@
 names_2 = f.read().split("\n")  # List containing 10000 names
 f.close()
 
+class BinarySearchTree:
+    def __init__(self, value):
+        self.value = value
+        self.left = None
+        self.right = None
+
+    def insert(self, value):
+        if value < self.value:
+            if not self.left:
+                self.left = BinarySearchTree(value)
+            else:
+                self.left.insert(value)
+
+        elif value >= self.value:
+            if not self.right:
+                self.right = BinarySearchTree(value)
+            else:
+                self.right.insert(value)
+        pass
+
+# searches the binary search tree for the input value, returning a boolean indicating whether the value exists in the tree or not.
+    def contains(self, target):
+        # compare target to root
+        if target == self.value:
+            print(f"target {target} == self.value {self.value}")
+            return True
+        # if it's smaller, check left side
+        elif target < self.value:
+            print(f"target {target} < self.value {self.value}")
+            # first check that there is a left side; if not, return False
+            if not self.left:
+                print("no self.left")
+                return False
+            # else, if it doesn't match the left side, call contains on left side with same target
+            elif target != self.left:
+                print(f"target {target} != self.left {self.left}")
+                return self.left.contains(target)
+            else:
+                print(f"target {target} == self.left {self.left}")
+                return True
+        # else, check right side
+        elif target > self.value:
+            print(f"target {target} > self.value {self.value}")
+            # first check that there is a right side; if not, return False
+            if not self.right:
+                print("no self.right")
+                return False
+            # else, if it doesn't match the right side, call contains on right side with same target
+            elif target != self.right:
+                print(f"target {target} != self.right {self.right}")
+                return self.right.contains(target)
+            else:
+                print(f"target {target} == self.right {self.right}")
+                return True            
+        pass
+
+# 20.11 seconds
 duplicates = []
-for name_1 in names_1:
-    for name_2 in names_2:
-        if name_1 == name_2:
-            duplicates.append(name_1)
+# for name_1 in names_1:
+#     for name_2 in names_2:
+#         if name_1 == name_2:
+#             duplicates.append(name_1)
+
+
 
 end_time = time.time()
 print (f"{len(duplicates)} duplicates:\n\n{', '.join(duplicates)}\n\n")