November 30, 2019
Amitraj
Introduction to Linked Lists
-> Linked List is a very commonly used linear data structure which consists of group of nodes in a sequence.
-> Each node holds its own data and the address of the next node hence forming a chain like structure.
-> Linked Lists are used to create trees and graphs.
Advantages / Benefits of Linked Lists
1. Stacks and queues can be easily executed.
2. Insertion and deletion operations can be easily implemented.
Disadvantages of Linked Lists
1.Reverse Traversing is difficult in linked list.
2. No element can be accessed randomly; it has to access each node sequentially.
Applications of Linked Lists
1. Linked lists let you insert elements at the beginning and end of the list.
2. Linked lists are used to implement stacks, queues, graphs, etc.
-> Linked List is a very commonly used linear data structure which consists of group of nodes in a sequence.
-> Each node holds its own data and the address of the next node hence forming a chain like structure.
-> Linked Lists are used to create trees and graphs.
Advantages / Benefits of Linked Lists
1. Stacks and queues can be easily executed.
2. Insertion and deletion operations can be easily implemented.
3. Linked List reduces the access time.
Disadvantages of Linked Lists
1.Reverse Traversing is difficult in linked list.
2. No element can be accessed randomly; it has to access each node sequentially.
Applications of Linked Lists
1. Linked lists let you insert elements at the beginning and end of the list.
2. Linked lists are used to implement stacks, queues, graphs, etc.
3. In Linked Lists we don't need to know the size in advance.
Types of Linked Lists
There are 3 different implementations of Linked List available, they are:
1. Singly Linked List
2. Doubly Linked List
3. Circular Linked List
These linked lists are available in this blog so read it and ask me using comment if you find anything incorrect.
