Through linked list one can implement ____________.
Through linked list one can implement ____________.
The correct option is D All of these
Through linked list one can implement-
stack, queue, graph.
Stack:-
In linked list implementation of stack,
the nodes are maintained non-contiguously in the memory. Each node contains a
pointer to its immediate successor node in the stack. Stack is said to be
overflown if the space left in the memory heap is not enough to create a node.
Queue:-
Queue is a
particular kind of abstract data type or collection in which the entities in
the collection are kept in order and the principal operations on the collection
are the addition of entities to the rear terminal position, known as enqueue,
and removal of entities from the front terminal position, known as dequeue.
This makes the queue a first-in-first-out (FIFO) data structure. Linked list is
a data structure consisting of a group of nodes which together represent a
sequence.
Graph:-
Adjacency list is the array[] of linked list, where array size is same as number of vertices in the graph. Every vertex has a linked list. Each node in this linked list represents
the reference to the other vertices which share an edge with the current
vertex. The weights can also be stored in the linked list node.
Through linked list one can implement- stack, queue, graph.
Stack:-
In linked list implementation of stack, the nodes are maintained non-contiguously in the memory. Each node contains a pointer to its immediate successor node in the stack. Stack is said to be overflown if the space left in the memory heap is not enough to create a node.
Queue:-
Queue is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue. This makes the queue a first-in-first-out (FIFO) data structure. Linked list is a data structure consisting of a group of nodes which together represent a sequence.
Graph:-
Adjacency list is the array[] of linked list, where array size is same as number of vertices in the graph. Every vertex has a linked list. Each node in this linked list represents the reference to the other vertices which share an edge with the current vertex. The weights can also be stored in the linked list node.
