binarysearch tree

names/names_bst.py

@@ -0,0 +1,59 @@
+class BinarySearchTree:
+    def __init__(self, value):  # just using value. key is value
+        self.value = value
+        self.left = None
+        self.right = None
+        self.root = None
+
+    # Insert the given value into the tree
+    # need to traverse to find spot to insert
+    def insert(self, value):
+        if value < self.value:
+            if not self.left:
+                self.left = BinarySearchTree(value)
+            else:
+                self.left.insert(value)
+
+        # if value >= self.value:
+        else:
+            if not self.right:
+                self.right = BinarySearchTree(value)
+            else:
+                self.right.insert(value)
+
+    # Return True if the tree contains the value
+    # False if it does not
+    # start from root and traverse the tree. we can stop at the first instance of a value. we know its not found if we get to a node that does not have children
+
+    def contains(self, target):
+        if target == self.value:
+            return True
+        if target < self.value:
+            if not self.left:
+                return False
+            else:
+                return self.left.contains(target)
+
+        else:
+            if self.right is None:
+                return False
+            else:
+                return self.right.contains(target)
+
+    # Return the maximum value found in the tree
+
+    def get_max(self):
+        if self.right:
+            return self.right.get_max()
+        else:
+            return self.value
+
+    # Call the function `cb` on the value of each node
+    # You may use a recursive or iterative approach
+    #
+    def for_each(self, cb):
+        cb(self.value)
+        if self.left:
+            self.left.for_each(cb)
+        if self.right:
+            self.right.for_each(cb)