...

src/abstract_structures/Queue.py

@@ -1,4 +1,5 @@
 #!/usr/bin/env python
+# Time: 5 min
 
 __author__ = "bt3"
 
@@ -8,33 +9,39 @@ class Queue(object):
         self.enq = []
         self.deq = []
 
-    def enqueue(self, value):
-        self.enq.append(value)
+    def enqueue(self, item):
+        return self.enq.append(item)
 
-    def dequeue(self):
+    def deque(self):
         if not self.deq:
             while self.enq:
                 self.deq.append(self.enq.pop())
         return self.deq.pop()
 
-    def isEmpty(self):
-        return not (self.enq + self.deq)
+    def peak(self):
+        if not self.deq:
+            while self.enq:
+                self.deq.append(self.enq.pop())
+        if self.deq:
+            return self.deq[-1]
 
     def size(self):
         return len(self.enq) + len(self.deq)
 
+    def isempty(self):
+        return not (self.enq + self.deq)
+
 if __name__ == '__main__':
     q = Queue()
-
-    for i in range(1,10):
+    for i in range(1,11):
         q.enqueue(i)
-
-    assert(q.isEmpty() == False)
-
-    assert(q.size() == 9)
-
-    for i in range(1, 10):
-        print q.dequeue()
-
-    assert(q.isEmpty() == True)
-
+    print 'Size:',  q.size()
+    print 'Is empty?', q.isempty()
+    print 'Peak: ', q.peak()
+    print
+    print 'Dequeuing...'
+    for i in range(10):
+        print q.deque()
+    print 'Size:',  q.size()
+    print 'Is empty?', q.isempty()
+    print 'Peak: ', q.peak()