{"id":8751,"date":"2022-06-28T11:06:14","date_gmt":"2022-06-28T11:06:14","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=8751"},"modified":"2022-07-20T09:43:00","modified_gmt":"2022-07-20T09:43:00","slug":"queue-data-structure","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/queue-data-structure\/","title":{"rendered":"Queue Data Structure"},"content":{"rendered":"

\"\"<\/p>\n

Queue:<\/h3>\n

A queue is basically a linear data structure that works on the principle of FIFO (First in First out)<\/strong> which means an element that is enqueued first will be dequeued first. Element is enqueued from the rear end of the queue and dequeued from the front end. The insertion operation in the queue is known as enqueue<\/strong> and the deletion operation in the queue is known as dequeue<\/strong>.
\nThe queue is used when the operations are to be performed in the manner of First in First out order just like Breadth-First Search. <\/p>\n

For Example A ticket Queue outside a cinema hall where the person enters the queue first will get the ticket first.<\/p>\n

\"\"<\/p>\n

Basic Operations of Queue:<\/h3>\n
    \n
  • \n

    Enqueue:<\/strong> This operation is used to Insert an element at the rear end of the queue.<\/p>\n<\/li>\n

  • \n

    Dequeue:<\/strong> This operation is used to remove and return an element from the front end of the queue. <\/p>\n<\/li>\n

  • \n

    isEmpty()<\/strong>: This operation is used to check whether the queue is empty or not. It returns bool value, if the queue is empty then this operation will return true else false.<\/p>\n<\/li>\n

  • \n

    isFull():<\/strong> This operation is used to check whether the queue is full or not. It return true is the queue is full, else it will return false.<\/p>\n<\/li>\n

  • \n

    Peek():<\/strong> This operation is used to get the value of the element from the front of the queue.<\/p>\n<\/li>\n<\/ul>\n

    Working of queue:<\/h3>\n
      \n
    • We can implement queue by using two pointers i.e. FRONT and REAR.<\/li>\n
    • FRONT is used to track the first element of the queue.<\/li>\n
    • REAR is used to track the last element of the queue.<\/li>\n
    • Initially, we\u2019ll set the values of FRONT and REAR to -1.<\/li>\n<\/ul>\n

      <\/p>\n

      Enqueue Operation \/ Insertion:<\/h3>\n
        \n
      • First check if the queue is full or not.<\/li>\n
      • For the first element, set the FRONT pointer to 0.<\/li>\n
      • Increment the REAR index by 1.<\/li>\n
      • Add the new element in the position which was pointed by REAR.<\/li>\n<\/ul>\n\t\t\t\t\t\t