[go: up one dir, main page]
Scribd
Upload
6 views3 pages

Introduction To Linked Lists

Linked Lists are a linear data structure consisting of nodes that hold data and the address of the next node, forming a chain-like structure. They offer advantages such as dynamic memory allocation and ease of insertion and deletion, but have disadvantages like memory wastage and sequential access. There are three types of Linked Lists: Singly Linked List, Doubly Linked List, and Circular Linked List, each with distinct characteristics.

Uploaded by

Dhana Sekaran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views3 pages

Introduction To Linked Lists

Linked Lists are a linear data structure consisting of nodes that hold data and the address of the next node, forming a chain-like structure. They offer advantages such as dynamic memory allocation and ease of insertion and deletion, but have disadvantages like memory wastage and sequential access. There are three types of Linked Lists: Singly Linked List, Doubly Linked List, and Circular Linked List, each with distinct characteristics.

Uploaded by

Dhana Sekaran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

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 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.

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.

Applications 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.
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
Let's know more about them and how they are different from each
other.

Singly Linked List


Singly linked lists contain nodes which have a data part as well as
an address part i.e. next, which points to the next node in the
sequence of nodes.

The operations we can perform on singly linked lists


are insertion, deletion and traversal.

Doubly Linked List


In a doubly linked list, each node contains a data part and two
addresses, one for the previous node and one for the next node.
Circular Linked List
In circular linked list the last node of the list holds the address of the
first node hence forming a circular chain.

You might also like