Merge pull request #154 from GreenJoey/patch-1

Update queue.py

algorithms/data_structures/queue.py

@@ -17,15 +17,15 @@
 class Queue:
 
     def __init__(self):
-        self.queue_list = deque([])
+        self._queue = deque([])
 
     def add(self, value):
         """
         Add element as the last item in the Queue.
 
         Worst Case Complexity:  O(1)
         """
-        self.queue_list.append(value)
+        self._queue.append(value)
 
     def remove(self):
         """
@@ -34,20 +34,20 @@ def remove(self):
         Worst Case Complexity:  O(1)
         """
 
-        return self.queue_list.popleft()
+        return self._queue.popleft()
 
     def is_empty(self):
         """
         Returns a boolean indicating if the Queue is empty.
 
         Worst Case Complexity:  O(1)
         """
-        return not len(self.queue_list)
+        return not len(self._queue)
 
     def size(self):
         """
         Return size of the Queue.
 
         Worst Case Complexity:  O(1)
         """
-        return len(self.queue_list)
+        return len(self._queue)