changed implementation to not use built in python lists. added English comments
Description
Previous implementation used built in python lists which seems counter to the point of implementing a queue data structure since python lists already support queue functionality. I also added English comments since there is an open issue about that (#183).
New Queue:
queue data structure built from scratch
enqueue: will add an element to the tail of the queue
dequeue: will remove the element at the head of the queue if the queue is not empty
show: will show the elements in the queue, with the first element being the head of the queue
length: will return the length of the queue
To test the implementation you can run the file since it includes test cases in the main function of the file
changed implementation to not use built in python lists. added English comments
Description
Previous implementation used built in python lists which seems counter to the point of implementing a queue data structure since python lists already support queue functionality. I also added English comments since there is an open issue about that (#183).
New Queue:
To test the implementation you can run the file since it includes test cases in the main function of the file