Saturday 13 December 2014

wap to implement circular link list

wap to implement circular link list

#include<stdio.h>
#include<conio.h>
#include<alloc.h>
typedef struct node
{
int data;
struct node *next;
}node;
void main()
{
node *rear,*p;
int n,i;
printf("\nenter no of elements");
scanf("%d",&n);
rear=(node*)malloc(sizeof(node));
scanf("%d",&rear->data);
rear->next=rear;
for(i=1;i<n;i++)
{
p=(node*)malloc(sizeof(node));
scanf("%d",&p->data);
p->next=rear->next;
rear->next=p;
rear=p;
}
p=rear->next;
do
{
printf("\ndata=%daddress=%unext data address=%u",p->data,&p->data,&p->next->data);
p=p->next;
}while(p!=rear->next);
getch();
}

No comments:

Post a Comment