Linked List is a linear data structure which consists of group of nodes in a sequence. A linked list data structure includes a series of connected nodes. Each node store the data and the address of the next node.  Limitations of Array Fixed size Contiguous memory block Insertion and deletion is costly Advantages of Linked Lists They are a dynamic in nature which allocates the memory when required. Insertion and deletion operations can be easily implemented. Disadvantages of Linked Lists The memory is wasted as pointers require extra memory for storage. No element can be accessed randomly; it has to access each node sequentially. Reverse Traversing is difficult in linked list. For More details you can check our Video Tutorial https://www.youtube.com/watch?v=ku1rsCn1hY8

1. Linked List
• Linked List is a linear data structure which consists of group
of nodes in a sequence.
• A linked list data structure includes a series of connected nodes.
• Each node store the data and the address of the next node.

2. 7 45 8 65 11 4 9 5 66 87 36
100 104 108 112 116 120 124 128 132 136 140 144 148 152 156 160 164 168
Need of Linked list

3. 240 7 45 8 65 11 340 440 4 9 5 66 87 36
100 104 108 112 116 120 124 128 132 136 140 144 148 152 156 160 164 168
240 128 340 132 440 NULL
Need of Linked list

4. Limitations of Array
• Fixed size
• Contiguous memory block
• Insertion and deletion is costly
7 45 8 65 11

5. Advantages of Linked Lists
• They are a dynamic in nature which allocates the memory when
required.
• Insertion and deletion operations can be easily implemented.

6. Disadvantages of Linked Lists
• The memory is wasted as pointers require extra memory for storage.
• No element can be accessed randomly; it has to access each node
sequentially.
• Reverse Traversing is difficult in linked list.