File tree Expand file tree Collapse file tree 1 file changed +5
-5
lines changed
algorithms/data_structures Expand file tree Collapse file tree 1 file changed +5
-5
lines changed Original file line number Diff line number Diff line change 1717class Queue :
1818
1919 def __init__ (self ):
20- self ._queue_list = deque ([])
20+ self ._queue = deque ([])
2121
2222 def add (self , value ):
2323 """
2424 Add element as the last item in the Queue.
2525
2626 Worst Case Complexity: O(1)
2727 """
28- self ._queue_list .append (value )
28+ self ._queue .append (value )
2929
3030 def remove (self ):
3131 """
@@ -34,20 +34,20 @@ def remove(self):
3434 Worst Case Complexity: O(1)
3535 """
3636
37- return self ._queue_list .popleft ()
37+ return self ._queue .popleft ()
3838
3939 def is_empty (self ):
4040 """
4141 Returns a boolean indicating if the Queue is empty.
4242
4343 Worst Case Complexity: O(1)
4444 """
45- return not len (self ._queue_list )
45+ return not len (self ._queue )
4646
4747 def size (self ):
4848 """
4949 Return size of the Queue.
5050
5151 Worst Case Complexity: O(1)
5252 """
53- return len (self ._queue_list )
53+ return len (self ._queue )
You can’t perform that action at this time.
0 commit comments