Scribd
Upload
94 views

Data Structure Unit 3 PPT Cs 3rd WK

Linked lists are data structures made up of nodes connected by links to form a sequence. Each link contains a connection to the next link. Common operations on linked lists include insertion, deletion, display, search, and deletion of elements. Insertion involves creating a new node and connecting it to the nodes around it. Deletion removes links between nodes. Reverse operation reverses the direction of all links in the list. There are different types of linked lists including singly linked, doubly linked, and circular linked lists.

Uploaded by

Hirut Getachew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
94 views

Data Structure Unit 3 PPT Cs 3rd WK

Linked lists are data structures made up of nodes connected by links to form a sequence. Each link contains a connection to the next link. Common operations on linked lists include insertion, deletion, display, search, and deletion of elements. Insertion involves creating a new node and connecting it to the nodes around it. Deletion removes links between nodes. Reverse operation reverses the direction of all links in the list. There are different types of linked lists including singly linked, doubly linked, and circular linked lists.

Uploaded by

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

Gambella University

Department Of Computer Science


Data Structure and Algorithms Course
Unit 3 -: Linked Lists
Instructor: Takele A. (MSc. In CoSc.)
Linked List Definition

• A linked list is a sequence of data structures, which are connected together via
links.
• Linked List is a sequence of links which contains items. Each link contains a
connection to another link. Linked list is the second most-used data structure
after array. Following are the important terms to understand the concept of
Linked List.
Link − Each link of a linked list can store a data called an element.
Next − Each link of a linked list contains a link to the next link called Next.
LinkedList − A Linked List contains the connection link to the first link called First.
Linked List Representation

Linked list can be visualized as a chain of nodes,


where every node points to the next node .
As per the above illustration, following are the important points to
be considered.

 Linked List contains a link element called first.


 Each link carries a data field(s) and a link field called next.
 Each link is linked with its next link using its next link.
 Last link carries a link as null to mark the end of the list.
Basic Operations

Following are the basic operations supported by a list.

 Insertion − Adds an element at the beginning of the list.


 Deletion − Deletes an element at the beginning of the list.
 Display − Displays the complete list.
 Search − Searches an element using the given key.
 Delete − Deletes an element using the given key.
Insertion Operation
Adding a new node in linked list is a more than one step activity.
We shall learn this with diagrams here.
First, create a node using the same structure and find the location
where it has to be inserted.
Imagine that we are inserting a node B (New Node),
between A (Left Node) and C (Right Node).
Then point B. next to C. New Node next −> Right Node;
It should look like this

Now, the next node at the left should point to the new node.
LeftNode.next −> NewNode;
This will put the new node in the middle of the two. The new list should look like this −
Similar steps should be taken if the node is being inserted at the beginning of
the list. While inserting it at the end, the second last node of the list should
point to the new node and the new node will point to NULL.

Deletion Operation

Deletion is also a more than one step process.


We shall learn with pictorial representation.
First, locate the target node to be removed, by using searching
algorithms .
The left (previous) node of the target node now should point to the
next node of the target node −

LeftNode.next −> TargetNode.next;


This will remove the link that was pointing to the target node. Now,
using the following code, we will remove what the target node is
pointing at.
We need to use the deleted node. We can keep that in memory otherwise we
can simply deallocate memory and wipe off the target node completely.
Already deleted
Reverse Operation
This operation is a thorough one. We need to make the last node to
be pointed by the head node and reverse the whole linked list.
First, we traverse to the end of the list. It should be pointing to
NULL. Now, we shall make it point to its previous node −
We have to make sure that the last node is not the last node. So
we'll have some temp node, which looks like the head node
pointing to the last node. Now, we shall make all left side nodes
point to their previous nodes one by one.
Except the node (first node) pointed by the head node, all nodes
should point to their predecessor, making them their new successor.
The first node will point to NULL.
We'll make the head node point to the new first node by using the temp node.

The linked list is now reversed.


Types of Linked List
Following are the various types of linked list.
 Simple Linked List − Item navigation is forward only.
 Doubly Linked List − Items can be navigated forward and
backward.
 Circular Linked List − Last item contains link of the first
element as next and the first element has a link to the last element
as previous.
Singly Linked List
A Singly linked list is a unidirectional linked list. So, you can only
traverse it in one direction, i.e., from head node to tail node.
Doubly Linked List
A doubly linked list is a bi-directional linked list. So, you can
traverse it in both directions. Unlike singly linked lists, its nodes
contain one extra pointer called the previous pointer. This pointer
points to the previous node.
Circular Linked List

A circular linked list is a unidirectional linked list. So, you can


traverse it in only one direction. But this type of linked list has its
last node pointing to the head node. So while traversing, you need
to be careful and stop traversing when you revisit the head node.

You might also like