“A _____________ is a collection of components,called nodes.Every
node(except the last node) , contains the address of the next
node”
linked list
“A linked list is a collection of components,called _________.Every
node(except the last node) , contains the address of the next
node”
nodes
“Linked List is a __________, in which elements are not
stored at a contiguous location, rather they are linked using
pointers. Linked List forms a series of connected nodes, where
each node stores the data and the address of the next node.”
linear data structure
“In a _____________, each node contains a reference to the next
node in the sequence. Traversing a singly linked list is done in a
forward direction.”
singly linked list
“In a___________, each node contains references to both the
next and previous nodes. This allows for traversal in both forward
and backward directions, but it requires additional memory for the
backward reference.”
doubly linked list
” In a ___________ , the last node points back to the head
node, creating a circular structure. It can be either singly or doubly
linked..”
circular linked list
Linked lists can grow or shrink dynamically, as
memory allocation is done at runtime.
Dynamic Size:
Adding or removing elements from a linked
list is efficient, especially for large lists.
Insertion and Deletion:
Linked lists can be easily reorganized and modified
without requiring a contiguous block of memory.
Flexibility:
Unlike arrays, linked lists do not allow direct
access to elements by index. Traversal is required to reach a
specific node.
Random Access:
Linked lists require additional memory for storing the
pointers, compared to arrays.
Extra Memory:
It holds the actual value or data associated with the node.
Data:
The linked list is accessed through the head node, which
points to the first node in the list.
Head:
It stores the memory address (reference) of the
next node in the sequence.
Next Pointer:
“This method can also be optimized to work in O(1) by keeping an
extra pointer to the tail of the linked list”
Time complexity:
“The _______ operation walks through all the elements of the list
in an order and displays the elements in that order.”
traversal
“A ______________ is a special type of linked list in which each
node contains a pointer to the previous node as well as the next
node in the structure.”
doubly linked list
The size of a doubly linked list can change dynamically,
meaning that nodes can be added or removed as needed.
Dynamic size:
_____________ In a doubly linked list, each node contains pointers to
both the previous and next elements, allowing for navigation in both forward
and backward directions.
Two-way navigation:
___________ Each node in a doubly linked list requires memory for two
pointers (previous and next), in addition to the memory required for the data
stored in the node.
Memory overhead:
