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

Explain the stack, QUESTION Explain the following data structures: ...

QUESTION Explain the following data structures: (a) List (b) Stack (c) Queues Note : your explanation should consist of the definition, operations and examples.

Define the terms - key attribute and value set, Define the terms   ...

Define the terms     i) Key attribute     ii) Value set  Key attribute:  An entity  type  usually  has  an attribute  whose  values  are  distinct  fr

Explain b tree (binary tree), B Tree Unlike a binary-tree, every node o...

B Tree Unlike a binary-tree, every node of a B-tree may have a variable number of keys and children. The keys are stored in non-decreasing order. Every key has an associated ch

Creation of a circular linked list, Program: Creation of a Circular linked ...

Program: Creation of a Circular linked list ALGORITHM (Insertion of an element into a Circular Linked List) Step 1        Begin Step 2      if the list is empty or new

Linked lists, what are grounded header linked lists?

what are grounded header linked lists?

Algorithm for binary search, Q. Write down the algorithm for binary search....

Q. Write down the algorithm for binary search. Which are the conditions under which sequential search of a list is preferred over the binary search?

Creation of Heap, Q. Create a heap with the given list of keys: ...

Q. Create a heap with the given list of keys: 8, 20, 9, 4, 15, 10, 7, 22, 3, 12                                                  Ans: Creation

A tree having ''m'' nodes has (m-1) branches. prove., Q. Prove the hypothes...

Q. Prove the hypothesis that "A tree having 'm' nodes has exactly (m-1) branches".      Ans: A tree having m number of nodes has exactly (m-1) branches Proof: A root

Algorithms, Write an algorithm to print all even numbers in descending orde...

Write an algorithm to print all even numbers in descending order and draw the flowchart

Develop a material requirements plan, The below figure illustrates the BOM ...

The below figure illustrates the BOM (Bill of Materials) for product A. The MPS (Material requirements Planning) start row in the master production schedule for product A calls for

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