Remove constraint that reverse needs to be implemented recursively

Author: seanchen1991

reverse/reverse.py

@@ -1,8 +1,6 @@
 class Node:
     def __init__(self, value=None, next_node=None):
-        # the value at this linked list node
         self.value = value
-        # reference to the next node in the list
         self.next_node = next_node
 
     def get_value(self):
@@ -12,17 +10,15 @@ def get_next(self):
         return self.next_node
 
     def set_next(self, new_next):
-        # set this node's next_node reference to the passed in node
         self.next_node = new_next
 
-
 class LinkedList:
     def __init__(self):
-        # reference to the head of the list
         self.head = None
 
     def add_to_head(self, value):
         node = Node(value)
+
         if self.head is not None:
             node.set_next(self.head)
 
@@ -31,20 +27,16 @@ def add_to_head(self, value):
     def contains(self, value):
         if not self.head:
             return False
-        # get a reference to the node we're currently at; update this as we
-        # traverse the list
+
         current = self.head
-        # check to see if we're at a valid node
+
         while current:
-            # return True if the current value we're looking at matches our
-            # target value
             if current.get_value() == value:
                 return True
-            # update our current node to the current node's next node
+
             current = current.get_next()
-        # if we've gotten here, then the target node isn't in our list
+
         return False
 
     def reverse_list(self, node, prev):
-        # You must use recursion for this solution
         pass

reverse/test_reverse.py

@@ -40,8 +40,5 @@ def test_longer_reverse(self):
     self.assertEqual(self.list.head.get_next().value, 2)
     self.assertEqual(self.list.head.get_next().get_next().value, 3)
 
-
- 
-
 if __name__ == '__main__':
   unittest.main()

ring_buffer/doubly_linked_list.py

@@ -1,32 +1,9 @@
-from doubly_linked_list import DoublyLinkedList
-
-
 class RingBuffer:
-    def __init__(self, capacity):
-        self.capacity = capacity
-        self.current = None
-        self.storage = DoublyLinkedList()
-
-    def append(self, item):
-        pass
-
-    def get(self):
-        # Note:  This is the only [] allowed
-        list_buffer_contents = []
-
-        # TODO: Your code here
-
-        return list_buffer_contents
-
-# ----------------Stretch Goal-------------------
-
-
-class ArrayRingBuffer:
     def __init__(self, capacity):
         pass
 
     def append(self, item):
         pass
 
     def get(self):
-        pass
+        pass

ring_buffer/ring_buffer.py

@@ -1,6 +1,5 @@
 import unittest
-from ring_buffer import RingBuffer, ArrayRingBuffer
-
+from ring_buffer import RingBuffer
 
 class RingBufferTests(unittest.TestCase):
     def setUp(self):