2. OUTLINE
1 INTRODUCTION
2 NODE
3 OPERATION ON LINKED LIST
4 DOUBLY LINKED LIST
5 CIRCULAR LINKED LIST
6 CIRCULAR DOUBLY LINKED LIST
7 ADVANTAGE
8 SUMMARY
SHIVAM GUPTA LINKED LIST
3. INTRODUCTION
A linked list is a series of connected nodes (or links) where
each node is a data structure.
Dynamically allocated data structures can be linked together
to form a chain.
SHIVAM GUPTA LINKED LIST
4. NODE
Each node has two parts :-
The First one is the info part that contain the actual data of
the list.
The Second one is the link part that points to the next node
of the list.
SHIVAM GUPTA LINKED LIST
5. OPERATION
Operation on linked list
The various actions performed on linked list are:-
1 Adding at beginning
2 Insert a node in between the linked list
3 Adding at end
4 Removing a Node
5 Traverse a linked list
SHIVAM GUPTA LINKED LIST
13. DOUBLY LINKED LIST
Every node stores a reference to previous node as well as its
next.This is good if you need to move back by a few nodes and
don’t want to start from the front again and again.
SHIVAM GUPTA LINKED LIST
14. CIRCULAR LINKED LIST
Every node stores a single reference but the last node inspite of
pointing to NULL points back to the front thus forming a closed
chain like structure.
SHIVAM GUPTA LINKED LIST
15. CIRCULAR DOUBLY LINKED LIST
Circular Doubly Linked List contain:- Each node store a reference
to the previous as well as the next one with pointing the last node
to the first node without any null value.
SHIVAM GUPTA LINKED LIST
16. ADVANTAGE
The Linked List advantages are collected because of the array
disadvantages, array disadvantages are:
1 Array Size
2 Memory allocation
3 Insertion and Deletion
ARRAY LINKED LIST
Size is to be specified. Not to declare size.
Static Memory Allocation Dynamic Memory Allocation
SHIVAM GUPTA LINKED LIST
17. SUMMARY
It is easy to insert a node at the front of a list.
The linked list toolkit also provides a function for inserting a
new node elsewhere
It is easy to remove a node at the front of a list.
The linked list toolkit also provides a function for removing a
node elsewhere–you should read about this
function and the other functions of the toolkit.
SHIVAM GUPTA LINKED LIST
