My Linked List Ppt

April 9, 2023 Nikitha 1

Doubly circular link list….

NIKITHA B CHOUDHARY 3rd sem, cse Jnnce ,Shimoga


Contents : Types of linked list

Disadvantages of singly linked list Doubly linked listCircular linked listDrawbacks of singly circular linked listHeader nodeInsert a node at the front end and rear

endDelete a node at the front end and rear

endDelete a node whose information is

specifiedInsert a node after the keyInsert a node before the keyAdvantages of doubly linked list Disadvantages of doubly linked list


Singly linked list

Doubly linked list

Singly circular linked list

Doubly circular linked list

tail

TYPES OF LINKED LIST

NIKITHA


Disadvantages of singly linked list

Using singly linked list it is not possible to traverse the list backwards.

Insertion/Deletion to a node to the left of the desired node is difficult.

It requires finding the predecessor which takes more time.

Due to this disadvantages of singly linked list doubly linked list came into existence…..


Doubly link list.. (Two way list)

Allow sequential access to the list in both directions Each node points to

Next node Previous node

Each node is divided into three parts

Info

Llink(Prev) ie.,Predecessor

Rlink(Next) ie.,Successor

.info

next

prev info next


Circular link list

A Circular Linked List is a special type of Linked List The next field of the last node contains a pointer, it points back

to the first node.. The drawbacks of linear linked list made way to circular linked

list..

Circular linked list

1.Singly circular linked list 2.Doubly circular linked list

Each of these linked list can be with header node and without header node..


Circular linked list had advantages over a linear list , but it still had several drawbacks..

They are overcomed by doubly linked list ..

Drawbacks of singly circular linked list :

[1] We cannot traverse in the backward direction

[2] A node cannot be deleted from a circularly linked list, given only a pointer to that node.


This is circular doubly link list….

20 3010 40

info next prev info next prev info next prev info next prev info

50

A circular doubly linked list

first node last node


Header node:

To minimize the number of checking for various cases, the Header Node is used.

The info field of the header node usually contains the number of nodes in the list.

10 204 30

llink info rlink llink info rlink llink info rlink llink info rlink llink info

rlink

40

first node last node

Circular Doubly Linked List With A Header Node

header node


An empty circular link list with Header Node:

head

llink rlink

Here the link field of the header node contains the address of itself..

So,

if (head rlink == head)

{

printf (“List is empty\n”);

return head;

}


Insert A Node At The Front End :

cur

3head 20 30 40

10

temp

Cur =head rlink

head rlink==temp;

temp llink==head;

temp rlink==cur;

cur llink==temp;


Insert A Node At The Rear End :

3

head

10 20 30 40

cur

temp

Cur =head rlink

head llink==temp;

temp rlink==head;

temp llink==cur;

cur rlink==temp;


Delete A Node From The Front End :

cur

3head 10 20 30

next

cur=head rlink;

next=cur rlink;

head rlink==next;

next llink=head;

printf (“The deleted item is %d \n”, cur info);

freenode (cur);


Delete A Node From The Rear End :

3head 10 20 30

prev

cur=head llink;

prev=cur llink;

head llink==prev;

prev rlink=head;

printf (“The deleted item is %d \n”, cur info);

freenode (cur);

cur


Delete A Node Whose information is specified :

prev

3head 10 20 30

cur

cur=head rlink;

while (cur!=head)

{ if (item==cur info) break;

cur=cur rlink; }

if (cur ==head)

{printf (“Item not found\n”); return head; }

prev=cur llink; next==cur rlink;

prev rlink=next; next llink=prev;

freenode (cur);

next


Insert A Node After The Key :

4

head

10 20 30 40

next

50

temp

cur


cur=head rlink;

while (cur!=head)

{ if (item==cur info) break;

cur=cur rlink; }

if (cur ==head)

{ printf (“Key not found\n”); return head;

}

next=cur rlink;

printf (“Item to be inserted to right of %d=“,item);

temp= getnode();

scanf (“% d”,& temp info);

cur rlink=temp;

temp link=cur;

next llink=temp;

temp rlink=next;

return head;


Insert A Node Before The Key :

4

head

10 20 30 40

50

temp

curprev


Advantages Of Doubly Linked List :

Using Doubly Linked List with a header node many problems can be solved very easily and efficiently.

They are extensively used in trees. Graphs can be represented using doubly

linked list.


Disadvantages of doubly circular linked list :

[1] Each node in the list requires two links, rlink and llink which requires additional storage for each field.

[2] During manipulation care has to be taken to manipulate both the links.


Thank You...………!!!!For listening

Have A Nice Day...........

“Don’t be like a blind bat that wings its silent flight under the cover of darkness, but be like a majestic eagle that

flies towards the sun...............!!”

Documents

My Linked List Ppt