Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 15 views

    Exp 2-Linked List Implementation of Stack and Queue

    Uploaded by

    Sneha S
    This document contains code for implementing a stack and queue using linked lists. It includes functions for push, pop, peek, isEmpty and size for the stack. For the queue it includes enqueue, dequeue, peek, isEmpty and size functions.

    Copyright:

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

    Exp 2-Linked List Implementation of Stack and Queue

    Uploaded by

    Sneha S
    15 views21 pages
    This document contains code for implementing a stack and queue using linked lists. It includes functions for push, pop, peek, isEmpty and size for the stack. For the queue it includes enqueue, dequeue, peek, isEmpty and size functions.

    Original Title

    EXP 2-LINKED LIST IMPLEMENTATION OF STACK AND QUEUE

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains code for implementing a stack and queue using linked lists. It includes functions for push, pop, peek, isEmpty and size for the stack. For the queue it includes enqueue, dequeue, peek, isEmpty and size functions.

    Copyright:

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

    Exp 2-Linked List Implementation of Stack and Queue

    Uploaded by

    Sneha S
    This document contains code for implementing a stack and queue using linked lists. It includes functions for push, pop, peek, isEmpty and size for the stack. For the queue it includes enqueue, dequeue, peek, isEmpty and size functions.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 21

    LINKED LIST IMPLEMENTATION OF STACK AND QUEUE

    STACK:-
    PROGRAM:-
    #include <stdio.h>
    #include <stdlib.h>

    struct node
    {
    int info;
    struct node *ptr;
    }*top,*top1,*temp;

    int topelement();
    void push(int data);
    void pop();
    void empty();
    void display();
    void destroy();
    void stack_count();
    void create();
    int count = 0;

    void main()
    {
    int no, ch, e;

    printf("\n 1 - Push");
    printf("\n 2 - Pop");
    printf("\n 3 - Top");
    printf("\n 4 - Empty");
    printf("\n 5 - Exit");
    printf("\n 6 - Dipslay");
    printf("\n 7 - Stack Count");
    printf("\n 8 - Destroy stack");

    create();
    while (1)
    {
    printf("\n Enter choice : ");
    scanf("%d", &ch);

    switch (ch)
    {
    case 1:
    printf("Enter data : ");
    scanf("%d", &no);
    push(no);
    break;
    case 2:
    pop();
    break;
    case 3:
    if (top == NULL)
    printf("No elements in stack");
    else
    {
    e = topelement();
    printf("\n Top element : %d", e);
    }
    break;
    case 4:
    empty();
    break;
    case 5:
    exit(0);
    case 6:
    display();
    break;
    case 7:
    stack_count();
    break;
    case 8:
    destroy();
    break;
    default :
    printf(" Wrong choice, Please enter correct choice ");
    break;
    }
    }
    }

    /* Create empty stack */


    void create()
    {
    top = NULL;
    }

    /* Count stack elements */


    void stack_count()
    {
    printf("\n No. of elements in stack : %d", count);
    }
    /* Push data into stack */
    void push(int data)
    {
    if (top == NULL)
    {
    top =(struct node *)malloc(1*sizeof(struct node));
    top->ptr = NULL;
    top->info = data;
    }
    else
    {
    temp =(struct node *)malloc(1*sizeof(struct node));
    temp->ptr = top;
    temp->info = data;
    top = temp;
    }
    count++;
    }

    /* Display stack elements */


    void display()
    {
    top1 = top;

    if (top1 == NULL)
    {
    printf("Stack is empty");
    return;
    }

    while (top1 != NULL)


    {
    printf("%d ", top1->info);
    top1 = top1->ptr;
    }
    }

    /* Pop Operation on stack */


    void pop()
    {
    top1 = top;

    if (top1 == NULL)
    {
    printf("\n Error : Trying to pop from empty stack");
    return;
    }
    else
    top1 = top1->ptr;
    printf("\n Popped value : %d", top->info);
    free(top);
    top = top1;
    count--;
    }

    /* Return top element */


    int topelement()
    {
    return(top->info);
    }

    /* Check if stack is empty or not */


    void empty()
    {
    if (top == NULL)
    printf("\n Stack is empty");
    else
    printf("\n Stack is not empty with %d elements", count);
    }

    /* Destroy entire stack */


    void destroy()
    {
    top1 = top;

    while (top1 != NULL)


    {
    top1 = top->ptr;
    free(top);
    top = top1;
    top1 = top1->ptr;
    }
    free(top1);
    top = NULL;

    printf("\n All stack elements destroyed");


    count = 0;
    }
    OUTPUT:-
    QUEUE:-
    PROGRAM:-
    #include <stdio.h>
    #include <stdlib.h>

    struct node
    {
    int info;
    struct node *ptr;
    }*front,*rear,*temp,*front1;

    int frontelement();
    void enq(int data);
    void deq();
    void empty();
    void display();
    void create();
    void queuesize();

    int count = 0;
    void main()
    {
    int no, ch, e;

    printf("\n 1 - Enque");
    printf("\n 2 - Deque");
    printf("\n 3 - Front element");
    printf("\n 4 - Empty");
    printf("\n 5 - Exit");
    printf("\n 6 - Display");
    printf("\n 7 - Queue size");
    create();
    while (1)
    {
    printf("\n Enter choice : ");
    scanf("%d", &ch);
    switch (ch)
    {
    case 1:
    printf("Enter data : ");
    scanf("%d", &no);
    enq(no);
    break;
    case 2:
    deq();
    break;
    case 3:
    e = frontelement();
    if (e != 0)
    printf("Front element : %d", e);
    else
    printf("\n No front element in Queue as queue is
    empty");
    break;
    case 4:
    empty();
    break;
    case 5:
    exit(0);
    case 6:
    display();
    break;
    case 7:
    queuesize();
    break;
    default:
    printf("Wrong choice, Please enter correct choice ");
    break;
    }
    }
    }

    /* Create an empty queue */


    void create()
    {
    front = rear = NULL;
    }

    /* Returns queue size */


    void queuesize()
    {
    printf("\n Queue size : %d", count);
    }

    /* Enqueing the queue */


    void enq(int data)
    {
    if (rear == NULL)
    {
    rear = (struct node *)malloc(1*sizeof(struct node));
    rear->ptr = NULL;
    rear->info = data;
    front = rear;
    }
    else
    {
    temp=(struct node *)malloc(1*sizeof(struct node));
    rear->ptr = temp;
    temp->info = data;
    temp->ptr = NULL;

    rear = temp;
    }
    count++;
    }
    /* Displaying the queue elements */
    void display()
    {
    front1 = front;

    if ((front1 == NULL) && (rear == NULL))


    {
    printf("Queue is empty");
    return;
    }
    while (front1 != rear)
    {
    printf("%d ", front1->info);
    front1 = front1->ptr;
    }
    if (front1 == rear)
    printf("%d", front1->info);
    }
    /* Dequeing the queue */
    void deq()
    {
    front1 = front;

    if (front1 == NULL)
    {
    printf("\n Error: Trying to display elements from empty
    queue");
    return;
    }
    else
    if (front1->ptr != NULL)
    {
    front1 = front1->ptr;
    printf("\n Dequed value : %d", front->info);
    free(front);
    front = front1;
    }
    else
    {
    printf("\n Dequed value : %d", front->info);
    free(front);
    front = NULL;
    rear = NULL;
    }
    count--;
    }
    /* Returns the front element of queue */
    int frontelement()
    {
    if ((front != NULL) && (rear != NULL))
    return(front->info);
    else
    return 0;
    }
    /* Display if queue is empty or not */
    void empty()
    {
    if ((front == NULL) && (rear == NULL))
    printf("\n Queue empty");
    else
    printf("Queue not empty");
    }
    OUTPUT:-

    You might also like