Linked lists are a linear data structure consisting of nodes that are linked together in a sequence. Each node contains data and a pointer to the next node. There are three main types: singly linked lists where each node points to the next; doubly linked lists where each node points to both the next and previous nodes; and circular linked lists where the last node loops back to the first node. Linked lists are commonly used to implement stacks, queues, and graphs as they allow easy insertion and deletion of elements without needing to know the size in advance. They are more dynamic than arrays and have advantages for insertion/deletion and accessing stacks/queues.

1. LINKED LIST
Presented by:
MD ARIF HOSSAIN
ID: 182-15-11395
Sec: D
Semester: SPRING 2019
Department of Computer Science &
Engineering
Presented to:
MR.SHAH MD.TANVIR SIDDIQUEE
Senior Lecturer
Department of FSIT

2. CONTENTS
INTRODUCTION OF LINKED LISTS
TYPES OF LINKED LISTS
APPLICATION OF LINKED LISTS
ARRAY VS LINKED LISTS
ADVANTAGES OF LINKED LISTS

3. INTRODUCTION OF 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.

4. TYPES OF LINKED LISTS
There are 3 different implementations of Linked List available, they are:
Singly Linked List
Doubly Linked List
Circular Linked Lis

5. APPLICATION OF LINKED LISTS
Linked lists are used to implement stacks, queues, graphs, etc.
Linked lists let you insert elements at the beginning and end of the list.
In Linked Lists we don't need to know the size in advance.

6. ARRAY VS LINKED LISTS

7. ADVANTAGES OF LINKED
LISTS
They are a dynamic in nature which allocates the memory when required.
Insertion and deletion operations can be easily implemented.
Stacks and queues can be easily executed.
Linked List reduces the access time.

8. THANK YOU