hakk

A Queue is a linear data struture that is open at both ends. One end is always used to insert data (enqueue) and the other is used to remove data (dequeue). In can be thought of as a queue of poeple waiting to get tickets, the first person in line will be the first one called to purchase their ticket. Waiting in Queue Basic Operations enqueue() − add (store) an item to the queue. Read more...

A stack is a linear data structure that holds a collection of elements. It has two primary operations: Push (adds an element to the collection) and Pop (removes the most recently added element from the collection). By following this order it is a LIFO (last in, first out) collection and can be thought of as a stack of pancakes. Stack of pancakes Basic Operations push() - adds an item to the stack. Read more...

A linked list is a linear collection of data elements, their order is not given by their physical placement in memory. Instead they are constructed in such a way that each element points to the next. It is a data structure that consists of a collection of nodes which together represents a sequence. Nodes linked together Linked lists can be singly or doubly linked. Singly linked list A singly linked list would use a node with data and only one reference (link) to the next node. Read more...