Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
3 views

Chapter-5_Data-Structure-and-Algorithm

Chapter 5 discusses the concept of linked lists, which are data structures consisting of nodes connected by links. It covers types of linked lists (simple, doubly, and circular), basic operations (insertion, deletion, display, search), and their applications in dynamic memory allocation and data structures like stacks and queues. The chapter also includes exercises for identification and enumeration related to linked lists.

Uploaded by

kurumisora01
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views

Chapter-5_Data-Structure-and-Algorithm

Chapter 5 discusses the concept of linked lists, which are data structures consisting of nodes connected by links. It covers types of linked lists (simple, doubly, and circular), basic operations (insertion, deletion, display, search), and their applications in dynamic memory allocation and data structures like stacks and queues. The chapter also includes exercises for identification and enumeration related to linked lists.

Uploaded by

kurumisora01
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Chapter 5

Linked Lists Basic


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 Applications:


• Dynamic memory allocation
• Implemented in stack and queue
• In undo functionality of softwares  Hash tables, Graphs

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.

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.

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 (NewNode),


between A (LeftNode) and C (RightNode). Then point B. next to C. It should look like this:

Now, the next node at the left should point to the new node.
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:

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.

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.

Types of Linked List

Doubly Linked List


Doubly Linked List is a variation of Linked list in which navigation is possible in both ways,
either forward or backward easily as compared to Single Linked List. Following are the
important terms to understand the concept of doubly 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.
• Prev − Each link of a linked list contains a link to the previous link called Prev.
• LinkedList − A Linked List contains the connection link to the first link called First and
to the last link called Last.

Doubly Linked List Representation

As per the above illustration, following are the important points to be considered.
• Doubly Linked List contains a link element called first and last.
• Each link carries a data field(s) and two link fields called next and prev.
• Each link is linked with its next link using its next link.
• Each link is linked with its previous link using its previous link.
• The 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.
• Insert Last − Adds an element at the end of the list.
• Delete Last − Deletes an element from the end of the list.
• Insert After − Adds an element after an item of the list.
• Delete − Deletes an element from the list using the key.
• Display forward − Displays the complete list in a forward manner.
• Display backward − Displays the complete list in a backward manner.

Circular Linked List


Circular Linked List is a variation of Linked list in which the first element points to the
last element and the last element points to the first element. Both Singly Linked List and Doubly
Linked List can be made into a circular linked list.

Singly Linked List as Circular

In singly linked list, the next pointer of the last node points to the first node.

Doubly Linked List as Circular

In doubly linked list, the next pointer of the last node points to the first node and the
previous pointer of the first node points to the last node making the circular in both directions.
As per the above illustration, following are the important points to be considered.  The
last link's next points to the first link of the list in both cases of singly as well as doubly
linked list.

• The first link's previous points to the last of the list in case of doubly linked list.
Basic Operations

Following are the important operations supported by a circular list.


• insert − Inserts an element at the start of the list.
• delete − Deletes an element from the start of the list.
• display − Displays the list.

Chapter Exercises:

I. Identification. Identify the following:


_______________ 1. It contains link of the last item to first element as next and the first element
has a link to the last element as previous.
_______________ 2. It is a type of linked list where items can be navigated forward and
backward.
_______________ 3. It is a basic link operation where you can add an element at the beginning
of the list.
_______________ 4. In doubly linked list, each link of a linked list can store a data.
_______________ 5. It is a sequence of data structures which are connected together via links.

II. Enumeration. Enumerate the following:


1. Type of linked list
2. List basic operations
3. Linked list applications

You might also like