Keep Coding Keep Cheering!
A deque, also known as a double-ended queue, is an ordered collection of items similar to the queue. It has two ends, a front, and rear, and the items remain positioned in the collection.
August 11, 2020 | Data Structure, python | No comments
A queue is an ordered collection of items where the addition of new items happens at one end, called the “rear,” and the removal of existing items occurs at the other end, commonly called the “front.”
August 10, 2020 | Data Structure, python | No comments
A stack is an ordered collection of items where the addition of new items and the removal of existing items always takes place at the same end.
August 6, 2020 | Data Structure, python | No comments