Keep Coding Keep Cheering!
A singly linked list, in its simplest form, is a collection of nodes that collectively form a linear sequence. Each node stores a reference to an object that is an element of the sequence, as well as a reference to the next node of the list.
August 21, 2020 | Data Structure | 1 comment
Big-O notation is a relative representation of the complexity of an algorithm.
August 18, 2020 | Algorithm, Data Structure | No comments
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