Linked List: Introduction And Types

Data Structures

A linked list is a linear data structure in which elements are linked together using nodes. More generally, linked list is a collection of nodes where each node consists of two parts, ‘data’ and ‘link’ .

1. data: the actual element to be stored in list.
2. link: one or two links that point to next and previous node of list using pointer.

Unlike arrays, linked list elements are not stored at a contiguous location; the elements are linked using pointers.

Facts About Linked List

• The nodes of linked list are not stored contiguously in computer memory.
• No need to shift any element in list to insert or delete element.
• Memory for each node can be allocated whenever the need arises.
• The size of a linked list can grow or shrink dynamically.

Operations On Linked List

1. Creation: Create a linked list
2. Insertion : at the beginning, at the end, at the specified position
3. Deletion: at the beginning, at the end, at the specified position
4. Traversing: The process of getting through all nodes of linked list from one end to another. It may be forward or backward.
5. Searching: Find an element in the list.
6. Concatenation: Appending second list to the end of first.

Types Of Linked List

1. Singly(Linear) Linked List
2. Doubly Linked List
3. Circular Linked List
4. Circular Doubly Linked List

You May Also Like

Addition Of Polynomials Using Linked List Data Structures

Queue : Linked List Implementation Using C++ Data Structures

Stack : Linked List Implementation Using C++ Data Structures

Linked List: Template Implementation Of Circular Linked List Using C++ Data Structures

Linked List: Template Implementation Of Doubly Linked List Using C++ Data Structures