Software Engineering
Arrays in Data
Structure
Professor: Nurilla Mahamatov
Computer Sciences Department, Head
Software Engineering
2D Array: Two-Dimensional
Arrays
Professor: Nurilla Mahamatov
Computer Sciences Department, Head
Software Engineering
A Singly Linked List in
Data Structures
Professor: Nurilla Mahamatov
Computer Sciences Department, Head
Table of Contents
• How to Implement a Singly Linked List?
• What Operations Can You Perform on a Singly Linked
List?
• How to Insert a Node in a Singly Linked List?
• How to Remove a Node From a Singly Linked List?
• What Are the Benefits of a Singly Linked List?
• What Are the Limitations of a Singly Linked List?
Deletion
Deletion
Deletion
Deletion
Deletion
How to Insert a Node in a Singly Linked List?
How to Remove a Node From a Singly Linked
List?
Benefits of a Singly Linked List
• You can perform operations like insertion and deletion with
ease
• It is a dynamic data structure, i.e., it does not have a fixed
size
• It doesn’t require the movement of nodes for insertion and
deletion
• It doesn’t need elements to be stored in consecutive
memory spaces
• It does not waste space as it uses space according to the
requirement
Limitations of a Singly Linked List
• It requires more storage space because it also stores
the next pointer with data
• If you have to reach any node, then you have to go
through every node before it
• You can not traverse it from anywhere but the head
node
• It requires a different amount of time to access any
elements
• Sorting is complex in this linked lis
Software Engineering
Doubly Linked List
Professor: Nurilla Mahamatov
Computer Sciences Department, Head
Table of Contents
• How Do You Implement a Doubly Linked List?
• What Operations Can You Perform on a Doubly Linked
List?
• How Do You Traverse a Doubly Linked List?
• How Do We Insert a Node in a Doubly Linked List?
• How Do You Remove a Node From a Doubly Linked
List?
• What Are the Benefits of a Doubly Linked List?
• What Are the Limitations of a Doubly Linked List?
How Do You Implement a Doubly Linked
List?
How Do You Traverse a Doubly Linked List?
How Do We Insert a Node in a Doubly Linked List?
How Do You Remove a Node From a Doubly
Linked List?
What Are the Benefits of a Doubly Linked List?
• It is easy to reverse this linked list.
• It is easier to delete a node from this linked list as
compared to a singly linked list.
• During its execution, it can easily assign or reassign
memory.
• Reverse traversal is faster in this linked list.
• You can implement complex data structures like stacks
and binary trees.
What Are the Limitations of a Doubly Linked List?
• It requires more space for each node because these
nodes have an extra pointer.
• Its insertion and deletion operations are slower than
singly-linked lists as it requires more steps.
• Because of random storage in memory, elements need
to be accessed sequentially.
