What is a linked list? | Types of Linked Lists| Operations on Linked Lists
Why linked list data structure is needed?
Dynamic Data structure: The size of memory can be allocated or de-allocated at run time based on the operation insertion or deletion.
Ease of Insertion/Deletion: The insertion and deletion of elements are simpler than arrays since no elements need to be shifted after insertion and deletion, Just the address needed to be updated.
Efficient Memory Utilization: As we know Linked List is a dynamic data structure the size increases or decreases as per the requirement so this avoids the wastage of memory.
Implementation: Various advanced data structures can be implemented using a linked list like a stack, queue, graph, hash maps, etc.
Commonly used operations on Singly Linked List:
Insertion Operation can be performed in three ways. They are as follows…
Inserting At the Beginning of the list
Inserting At End of the list
Inserting At Specific location in the list
Deletion operation can be performed in three ways. They are as follows…
Deleting from the Beginning of the list
Deleting from the End of the list
Deleting a Specific Node
Search: It is a process of determining and retrieving a specific node.
Display: This process displays the elements of a Single-linked list.