My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Circular doubly linked list.
Posted Date: 16 Feb 2008 Resource Type: Articles/Knowledge Sharing Category: Computer & Technology
|
Posted By: Gurpreet Singh Member Level: Gold
Rating:  Points: 3
|
|
|
#include
#include
struct node
{
int info;
struct node *left,*right;
};
typedef struct node node;
node *head;
node *create(node *head)
{
head=(node *)malloc(sizeof(node));
head->left=head->right=head;
head->info=0;
return(head);
}
node *ins_beg(node *head)
{
node *ptr,*temp;
int item;
ptr=(node *)malloc(sizeof(node));
printf("Enter the number ");
scanf("%d",&item);
ptr->info=item;
temp=head->right;
head->right=ptr;
ptr->left=head;
ptr->right=temp;
temp->left=ptr;
return(head);
}
node *ins_end(node *head)
{
node *ptr,*temp;
int item;
ptr=(node *)malloc(sizeof(node));
printf("Enter the number ");
scanf("%d",&item);
ptr->info=item;
temp=head->left;
temp->right=ptr;
ptr->left=temp;
ptr->right=head;
head->left=ptr;
return(head);
}
node *del_beg(node *head)
{
node *temp;
if(head->right==head)
printf("Empty");
else
{
temp=head->right;
printf("Deleted element is %d",temp->info);
head->right=temp->right;
temp->right->left=head;
free(temp);
}
return(head);
}
node *del_end(node *head)
{
node *temp;
if(head->right==head)
printf("Empty");
else
{
temp=head->left;
printf("Deleted element is %d",temp->info);
head->left=temp->left;
temp->left->right=head;
free(temp);
}
return(head);
}
void main()
{
int choice;
clrscr();
do
{
printf("\n1. Create link list");
printf("\n2. Insert at beginning");
printf("\n3. Insert at end");
printf("\n4. Delete at beginning");
printf("\n5. Delete at end");
printf("\n6. Exit ");
scanf("%d",&choice);
switch(choice)
{
case 2:
head=ins_beg(head);
break;
case 3:
head=ins_end(head);
break;
case 4:
head=del_beg(head);
break;
case 5:
head=del_end(head);
break;
case 1:
head=create(head);
break;
case 6:
exit(0);
}
}
while(choice!=6);
getch();
}
/* Output is :
1. Create link list
2. Insert at beginning
3. Insert at end
4. Delete at beginning
5. Delete at end
6. Exit 1
1. Create link list
2. Insert at beginning
3. Insert at end
4. Delete at beginning
5. Delete at end
6. Exit 2
Enter the number 6
1. Create link list
2. Insert at beginning
3. Insert at end
4. Delete at beginning
5. Delete at end
6. Exit 3
Enter the number 8
1. Create link list
2. Insert at beginning
3. Insert at end
4. Delete at beginning
5. Delete at end
6. Exit 3
Enter the number 9
1. Create link list
2. Insert at beginning
3. Insert at end
4. Delete at beginning
5. Delete at end
6. Exit 4
Deleted element is 6
1. Create link list
2. Insert at beginning
3. Insert at end
4. Delete at beginning
5. Delete at end
6. Exit 6 */
|
Responses
|
No responses found. Be the first to respond and make money from revenue sharing program.
|
|
Watch TV Channels
|