Program insertion of a node into any circular linked list, Data Structure & Algorithms

Assignment Help:

Program Insertion of a node into any Circular Linked List

Figure depicts a Circular linked list from which an element was deleted.

ALGORITHM (Deletion of an element from a Circular Linked List)

Step 1  Begin

Step 2  if the list is empty, element cannot be eliminated.

Step 3  else, if element desire  to be deleted at first node, then make the start (head) to point to the second element.

Step 4  else, Removeelement from the list by calling find function & returning the found address of the element.

Step 5  End.

2108_Program Insertion of a node into any Circular Linked List.png

Figure: A Circular Linked List through which an element was deleted

(Dotted line indicates the linked that existed prior to deletion)

Program demonstrated the code for the deletion of an element from the Circular linked list.

#include

#include

#define NULL 0

structlinked_list

{

int data;

structlinked_list *next;

};

typedefstructlinked_listclist;

clist *head, *s;

/* prototype of find and delete_function*/

clist * delete_clist(clist *);

clist * find(clist *, int);

/*description of delete_clist      */

clist *delete_clist(clist *start)

{

int key; clist * f, * temp;

printf("\n enter the element to be deleted \n");

scanf("%d", &key);

if(start->data == key)

{

temp=start->next; free(start);

start=temp;

}

else

{

f = find(start,key);

if(f==NULL)

printf("\n key not fund");

else

{

}

}

temp = f->next->next;

free(f->next);

f->next=temp;

 

return(start);

}

/*description of find function */

clist * find(clist *start, int key)

{

if(start->next->data == key)

return(start);

if(start->next->next == NULL)

return(NULL);

else

find(start->next, key);

}

void main()

{

voidcreate_clist(clist *);

int count(clist *);

void traverse(clist *);

head=(clist *)malloc(sizeof(clist));

s=head;

create_clist(head);

printf(" \n traversing the created clist and the starting address is %u \n", head);

traverse(head);

printf("\n number of elements in the clist   %d \n", count(head));

head=delete_clist(head);

printf(" \n traversing the clist after delete_clistand starting address is following %u \n",head);

traverse(head);

}

voidcreate_clist(clist *start)

{

printf("inputthe element -1111 for coming out of loop\n");

scanf("%d", &start->data);

if(start->data == -1111)

start->next=s;

else

{

start->next=(clist*)malloc(sizeof(clist));

create_clist(start->next);

}

}

void traverse(clist *start)

{

if(start->next!=s)

{

printf("data is %d \t next element address is %u\n", start->data,  start- traverse(start->next);

}

}

if(start->next == s)

printf("data is %d \t next element address is %u\n",start->data,   start->next);

int count(clist *start)

{

if(start->next == s)

return 0;

else

}

return(1+count(start->next));

Program: Deletion of an element from the circular linked list


Related Discussions:- Program insertion of a node into any circular linked list

Analyze an algorithm, In order to analyze an algorithm is to find out the a...

In order to analyze an algorithm is to find out the amount of resources (like time & storage) that are utilized to execute. Mostly algorithms are designed to work along with inputs

How to write binary search algorithm?, Q. Write down the binary search algo...

Q. Write down the binary search algorithm and trace to search element 91 in following given list: 13          30          62           73         81         88             91

Advantages of the last in first out method, Materials consumed are priced i...

Materials consumed are priced in a systematic and realistic manner. It is argued that current acquisition costs are incurred for the purpose of meeting current production and sales

Example of telephone directory, A telephone directory having n = 10 records...

A telephone directory having n = 10 records and Name field as key. Let us assume that the names are stored in array 'm' i.e. m(0) to m(9) and the search has to be made for name "X"

Algorithm to insert a node in between any two nodes, Q. Write down an algor...

Q. Write down an algorithm to insert a node in between any two nodes in a linked list         Ans. Insertion of a the node after the given element of the listis as follows

Data type, Q. Define the terms data type and abstract data type. Comment up...

Q. Define the terms data type and abstract data type. Comment upon the significance of both these.   Ans: We determine the total amount of memory to reserve by determining

Pre-order and post order traversal of a binary tree, The pre-order and post...

The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum One node

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd