Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    Double Ended Queue

    Uploaded by

    angelinapg2005

    Copyright:

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

    Double Ended Queue

    Uploaded by

    angelinapg2005
    16 views4 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    ODT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Download as odt, pdf, or txt
    16 views4 pages

    Double Ended Queue

    Uploaded by

    angelinapg2005

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Download as odt, pdf, or txt
    You are on page 1of 4

    Double ended queue

    #include <stdio.h>
    #include <stdlib.h>
    #define MAX 10
    int dequeue[MAX];
    int front = -1;
    int rear = -1;

    void insertFront(int item)


    {
    if (front == 0)
    {
    printf("Dequeue overflow\n");
    return;
    }
    else if (front == -1)
    {
    front = rear = 0;
    }
    else
    {
    front--;
    }
    dequeue[front] = item;
    }

    void insertRear(int item)


    {
    if (rear == MAX - 1)
    {
    printf("Dequeue overflow\n");
    return;
    }
    else if (rear == -1)
    {
    front = rear = 0;
    }
    else
    {
    rear++;
    }
    dequeue[rear] = item;
    }

    void deleteFront()
    {
    if (front == -1)
    {
    printf("Dequeue is empty\n");
    return;
    }
    printf("Deleted %d from the front\n", dequeue[front]);
    if (front == rear)
    {
    front = rear = -1;
    }
    else
    {
    front++;
    }
    }

    void deleteRear()
    {
    if (rear == -1)
    {
    printf("Dequeue is empty \n");
    return;
    }
    printf("Deleted %d from the rear\n", dequeue[rear]);
    if (front == rear)
    {
    front = rear = -1;
    }
    else
    {
    rear--;
    }
    }

    void display()
    {
    if (front == -1)
    {
    printf("Dequeue is empty \n");
    return;
    }
    printf("Dequeue elements: ");
    for (int i = front; i <= rear; i++)
    {
    printf("%d ", dequeue[i]);
    }
    printf("\n");
    }

    int main()
    {
    int choice, value;
    while (1)
    {
    printf("1. Insert at front\n");
    printf("2. Insert at rear\n");
    printf("3. Delete from front\n");
    printf("4. Delete from rear\n");
    printf("5. Display dequeue\n");
    printf("6. Exit\n");
    printf("Enter your choice: ");
    scanf("%d", &choice);
    switch (choice)
    {
    case 1:
    printf("Enter value to insert at front: ");
    scanf("%d", &value);
    insertFront(value);
    break;
    case 2:
    printf("Enter value to insert at rear: ");
    scanf("%d", &value);
    insertRear(value);
    break;
    case 3:
    deleteFront();
    break;
    case 4:
    deleteRear();
    break;
    case 5:
    display();
    break;
    case 6:
    printf("Exiting...\n");
    exit(0);
    default:
    printf("Invalid input.\n");
    }
    }

    return 0;
    }

    Output:

    You might also like