Chawnchristian

names/binary_search_tree.py

@@ -0,0 +1,41 @@
+class BST:
+    def __init__(self, value):
+        self.value = value
+        self.left = None
+        self.right = None
+
+    # Insert the given value into the tree
+    def insert(self, value):
+        node = BST(value)
+        if self.value is None:
+            self.value = value
+            return
+
+        elif value < self.value:
+            if self.left is None:
+             self.left = node
+            else:
+             self.left.insert(value)
+
+
+        elif value >= self.value:
+            if self.right is None:
+             self.right = node
+            else:
+             self.right.insert(value) 
+
+    # Return True if the tree contains the value
+    # False if it does not
+    def contains(self, target):
+
+        if target == self.value:
+            return True
+
+        elif target < self.value and self.left:
+            return self.left.contains(target)
+
+        elif target > self.value and self.right:
+            return self.right.contains(target)
+
+        else:
+            return False

names/names.py

@@ -1,4 +1,7 @@
 import time
+from binary_search_tree import BST
+
+
 
 start_time = time.time()
 
@@ -12,11 +15,18 @@
 
 duplicates = []  # Return the list of duplicates in this data structure
 
+search = BST('dup_name')
+for name in names_1:
+    search.insert(name)
+for name in names_2:
+     if search.contains(name):
+      duplicates.append(name)
 # Replace the nested for loops below with your improvements
-for name_1 in names_1:
+'''for name_1 in names_1:
     for name_2 in names_2:
         if name_1 == name_2:
-            duplicates.append(name_1)
+            duplicates.append(name_1)'''
+
 
 end_time = time.time()
 print (f"{len(duplicates)} duplicates:\n\n{', '.join(duplicates)}\n\n")

reverse/reverse.py

@@ -39,4 +39,13 @@ def contains(self, value):
         return False
 
     def reverse_list(self, node, prev):
-        pass
+        if self.head is None:
+            return
+        if node.next_node is None:
+            self.head = node
+            node.next_node = prev
+            return
+        node_next = node.next_node
+        node.next_node = prev
+
+        self.reverse_list(node_next, node)

ring_buffer/ring_buffer.py

@@ -1,9 +1,16 @@
 class RingBuffer:
     def __init__(self, capacity):
-        pass
+        self.capacity = capacity
+        self.arr = []
+        self.index = 0
+
 
     def append(self, item):
-        pass
+        if len(self.arr) is self.capacity:
+            self.arr[self.index] = item
+            self.index = (self.index + 1) % self.capacity
+        else:
+            self.arr.append(item)
 
     def get(self):
-        pass
+        return self.arr