Circular Linked List - Online Code

Description

In a circularly-linked list, the first and final nodes are linked together. This can be done for both singly and doubly linked lists. To traverse a circular linked list, you begin at any node and follow the list in either direction until you return to the original node. Viewed another way, circularly-linked lists can be seen as having no beginning or end. This type of list is most useful for managing buffers for data ingest, and in cases where you have one object in a list and wish to iterate through all other objects in the list in no particular order. The pointer pointing to the whole list may be called the access pointer.

Source Code

/* Program of circular linked list*/

# include <stdio.h>

# include <malloc.h>



struct node

{

	int info;

	struct node *link;

}*last;



main()

{

	int choice,n,m,po,i;

	last=NULL;

	while(1)

... (login or register to view full code)

To view full code, you must Login or Register, its FREE.

Hey, registering yourself just takes less than a minute and opens up a whole new GetGyan experience.




Comments

No comment yet. Be the first to post a comment.