{"id":9821,"date":"2022-09-20T05:42:20","date_gmt":"2022-09-20T05:42:20","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=9821"},"modified":"2022-12-14T09:22:53","modified_gmt":"2022-12-14T09:22:53","slug":"data-structures-in-c-queue-heap-2","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/data-structures-in-c-queue-heap-2\/","title":{"rendered":"Data Structures in C++ – Queue & Heap"},"content":{"rendered":"

\"\"<\/p>\n

In this article, we will be discussing Data Structures in C++ topics i.e. Queue and heap<\/a>.
\nA data structure is not only used for organizing the data. It is also used for processing, retrieving, and storing data. There are different basic and advanced types of data structures that are used in almost every program or software system that has been developed. So we must have good knowledge about data structures. <\/p>\n

Why Learn Data Structure?<\/h3>\n

Data structure and algorithms are two of the most important aspects of computer science. Data structures allow us to organize and store data, while algorithms allow us to process that data in a meaningful way. Learning data structure and algorithms will help you become a better programmer. You will be able to write code that is more efficient and more reliable. You will also be able to solve problems more quickly and more effectively.<\/p>\n

Data Structures in C++ is an important part of Programming. Get a better understanding of problems by watching these video tutorials<\/a> created by expert mentors at PrepBytes<\/a>.<\/em><\/p>\n

Queue:<\/h3>\n

A queue can be defined as an ordered list which enables insert operations to be performed at one end called REAR and delete operations to be performed at another end called FRONT. Queue is referred to as First In First Out list.
\nFor example, people waiting in line for a rail ticket form a queue.<\/p>\n

\"\"<\/p>\n

Operations performed on queue<\/h3>\n

The fundamental operations that can be performed on queue are listed as follows –<\/p>\n

    \n
  • Enqueue<\/strong>: The Enqueue operation is used to insert the element at the rear end of the queue. It returns void.<\/li>\n
  • Dequeue<\/strong>: It performs the deletion from the front-end of the queue. It also returns the element which has been removed from the front-end. It returns an integer value.<\/li>\n
  • Peek<\/strong>: This is the third operation that returns the element, which is pointed by the front pointer in the queue but does not delete it.<\/li>\n
  • Queue overflow (isfull)<\/strong>: It shows the overflow condition when the queue is completely full.<\/li>\n
  • Queue underflow (isempty)<\/strong>: It shows the underflow condition when the Queue is empty, i.e., no elements are in the Queue.<\/li>\n<\/ul>\n

    Applications of Queue<\/h3>\n

    Due to the fact that queue performs actions on a first in first out basis which is quite fair for the ordering of actions. There are various applications of queues discussed below.<\/p>\n

      \n
    1. Queues are widely used as waiting lists for a single shared resource like printer, disk, CPU.<\/li>\n
    2. Queues are used in asynchronous transfer of data (where data is not being transferred at the same rate between two processes) for eg. pipes, file IO, sockets.<\/li>\n
    3. Queues are used as buffers in most of the applications like MP3 media player, CD player, etc.<\/li>\n
    4. Queues are used to maintain the playlist in media players in order to add and remove the songs from the play-list.<\/li>\n
    5. Queues are used in operating systems for handling interrupts.<\/li>\n<\/ol>\n

      Working of Queue<\/h3>\n

      Queue operations work as follows:<\/p>\n

        \n
      • two pointers FRONT and REAR<\/li>\n
      • FRONT track the first element of the queue<\/li>\n
      • REAR track the last element of the queue<\/li>\n
      • initially, set value of FRONT and REAR to -1<\/li>\n<\/ul>\n

        Enqueue Operation<\/h3>\n
          \n
        • check if the queue is full<\/li>\n
        • for the first element, set the value of FRONT to 0<\/li>\n
        • increase the REAR index by 1<\/li>\n
        • add the new element in the position pointed to by REAR<\/li>\n<\/ul>\n

          Dequeue Operation<\/h3>\n
            \n
          • check if the queue is empty<\/li>\n
          • return the value pointed by FRONT<\/li>\n
          • increase the FRONT index by 1<\/li>\n
          • for the last element, reset the values of FRONT and REAR to -1<\/li>\n<\/ul>\n

            \"\"<\/p>\n

            Implementation:<\/h3>\n\t\t\t\t\t\t