Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Circular SLL

    Uploaded by

    Sagana C. CSE

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Circular SLL

    Uploaded by

    Sagana C. CSE
    7 views7 pages

    Original Title

    circular SLL

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    7 views7 pages

    Circular SLL

    Uploaded by

    Sagana C. CSE

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 7

    #include<stdio.

    h>
    #include<stdlib.h>
    struct node
    {
    int data;
    struct node *next;
    };
    struct node *head;

    void beginsert ();


    void lastinsert ();
    void randominsert();
    void begin_delete();
    void last_delete();
    void random_delete();
    void display();
    void search();
    void main ()
    {
    int choice =0;
    while(choice != 7)
    {
    printf("\n*********Main Menu*********\n");
    printf("\nChoose one option from the following list ...\n");
    printf("\n===============================================\
    n");
    printf("\n1.Insert in begining\n2.Insert at last\n3.Delete from Beginning\n4.Delete fr
    om last\n5.Search for an element\n6.Show\n7.Exit\n");
    printf("\nEnter your choice?\n");
    scanf("\n%d",&choice);
    switch(choice)
    {
    case 1:
    beginsert();
    break;
    case 2:
    lastinsert();
    break;
    case 3:
    begin_delete();
    break;
    case 4:
    last_delete();
    break;
    case 5:
    search();
    break;
    case 6:
    display();
    break;
    case 7:
    exit(0);
    break;
    default:
    printf("Please enter valid choice..");
    }
    }
    }
    void beginsert()
    {
    struct node *newnode,*temp;
    int item;
    newnode = (struct node *)malloc(sizeof(struct node));
    if(newnode == NULL)
    {
    printf("\nOVERFLOW");
    }
    else
    {
    printf("\nEnter the node data?");
    scanf("%d",&item);
    newnode -> data = item;
    if(head == NULL)
    {
    head = newnode;
    newnode -> next = head;
    }
    else
    {
    temp = head;
    while(temp->next != head)
    temp = temp->next;
    newnode->next = head;
    temp -> next = newnode;
    head = newnode;
    }
    printf("\nnode inserted\n");
    }

    }
    void lastinsert()
    {
    struct node *newnode,*temp;
    int item;
    newnode = (struct node *)malloc(sizeof(struct node));
    if(newnode == NULL)
    {
    printf("\nOVERFLOW\n");
    }
    else
    {
    printf("\nEnter Data?");
    scanf("%d",&item);
    newnode->data = item;
    if(head == NULL)
    {
    head = newnode;
    newnode -> next = head;
    }
    else
    {
    temp = head;
    while(temp -> next != head)
    {
    temp = temp -> next;
    }
    temp -> next = newnode;
    newnode -> next = head;
    }

    printf("\nnode inserted\n");
    }

    void begin_delete()
    {
    struct node *newnode;
    if(head == NULL)
    {
    printf("\nUNDERFLOW");
    }
    else if(head->next == head)
    {
    head = NULL;
    free(head);
    printf("\nnode deleted\n");
    }

    else
    { newnode = head;
    while(newnode -> next != head)
    newnode = newnode -> next;
    newnode->next = head->next;
    free(head);
    head = newnode->next;
    printf("\nnode deleted\n");
    }
    }
    void last_delete()
    {
    struct node *newnode, *prenewnode;
    if(head==NULL)
    {
    printf("\nUNDERFLOW");
    }
    else if (head ->next == head)
    {
    head = NULL;
    free(head);
    printf("\nnode deleted\n");

    }
    else
    {
    temp = head;
    while(temp ->next != head)
    {
    prenewnode=temp;
    temp = temp->next;
    }
    prenewnode->next = temp -> next;
    free(temp);
    printf("\nnode deleted\n");

    }
    }

    void search()
    {
    struct node *temp;
    int item,i=0,flag=1;
    temp = head;
    if(temp == NULL)
    {
    printf("\nEmpty List\n");
    }
    else
    {
    printf("\nEnter item which you want to search?\n");
    scanf("%d",&item);
    if(head ->data == item)
    {
    printf("item found at location %d",i+1);
    flag=0;
    }
    else
    {
    while (temp->next != head)
    {
    if(temp->data == item)
    {
    printf("item found at location %d ",i+1);
    flag=0;
    break;
    }
    else
    {
    flag=1;
    }
    i++;
    temp= temp-> next;
    }
    }
    if(flag != 0)
    {
    printf("Item not found\n");
    }
    }

    }
    void display()
    {
    struct node *temp;
    temp=head;
    if(head == NULL)
    {
    printf("\nnothing to print");
    }
    else
    {
    printf("\n printing values ... \n");

    while(temp -> next != head)


    {

    printf("%d\n", temp-> data);


    temp= temp -> next;
    }
    printf("%d\n", temp -> data);
    }

    You might also like