{"id":5358,"date":"2021-12-06T04:48:39","date_gmt":"2021-12-06T04:48:39","guid":{"rendered":"https:\/\/studysection.com\/blog\/?p=5358"},"modified":"2021-12-09T05:58:06","modified_gmt":"2021-12-09T05:58:06","slug":"implementation-of-queue-with-linked-list-in-c","status":"publish","type":"post","link":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/","title":{"rendered":"Implementation of Queue with Linked List in C++"},"content":{"rendered":"<h2>What is Queue?<\/h2>\n<p>It is a linear structure that follows first in first out ( FIFO) in which the operations are performed.<\/p>\n<p><strong><em>Before implementation, there are two major fundamental operations performed on a queue.<\/em><\/strong><\/p>\n<ul>\n<li><strong>Enqueue:<\/strong> This operation is used to insert the element at the rear end of the queue. It returns nothing.<\/li>\n<li><strong>Dequeue:<\/strong> This operation is used to delete the element from the front end. It also returns the element which has been removed from the front. It returns an integer value. <\/li>\n<li><strong>Peek:<\/strong> This is the third operation performed by the <a href=\"https:\/\/studysection.com\/blog\/jquery-3-x-quick-reference\/\">queue<\/a>. This returns the element which is pointed by the front pointer in the queue. But it does not delete the element from the queue.<\/li>\n<li><strong>Queue underflow (isempty):<\/strong> It is used to check if the queue is empty or not.<\/li>\n<\/ul>\n<p><code>#include &lt;bits\/stdc++.h><br \/>\nusing namespace std;<br \/>\n\/\/ Structure of Node.<br \/>\nstruct Node<br \/>\n{<br \/>\n    int data;<br \/>\n    Node *link;<br \/>\n};<br \/>\nNode *front = 0;<br \/>\nNode *rear = 0;<br \/>\n\/\/check if queue is empty or not<br \/>\nbool isempty()<br \/>\n{<br \/>\n    if(front == NULL && rear == NULL)<br \/>\n        return true;<br \/>\n    else<br \/>\n        return false;<br \/>\n}<br \/>\n\/\/enter elements in queue<br \/>\nvoid enqueue( int value )<br \/>\n{<br \/>\n    Node *ptr = new Node();<br \/>\n    ptr->data= value;<br \/>\n    ptr->link = NULL;<br \/>\n    \/\/If inserting the first element\/node<br \/>\n    if( front == NULL )<br \/>\n    {<br \/>\n        front = ptr;<br \/>\n        rear = ptr;<br \/>\n    }<br \/>\n    else<br \/>\n     {<br \/>\n        rear ->link = ptr;<br \/>\n        rear = ptr;<br \/>\n     }<br \/>\n}<br \/>\n\/\/delete\/remove element from queue<br \/>\nvoid dequeue( )<br \/>\n{<br \/>\n    if( isempty() )<br \/>\n        cout&lt;&lt;\"Queue is empty\\n\";<br \/>\n    else{<br \/>\n        \/\/only one element\/node in queue.<br \/>\n        if( front == rear)<br \/>\n        {<br \/>\n            free(front);<br \/>\n            front = rear = NULL;<br \/>\n        }<br \/>\n        else<br \/>\n        {<br \/>\n            Node *ptr = front;<br \/>\n            front = front->link;<br \/>\n            free(ptr);<br \/>\n        }<br \/>\n    }<br \/>\n}<br \/>\n\/\/show the element at front<br \/>\nvoid peek( )<br \/>\n{<br \/>\n    if( isempty())<br \/>\n        cout&lt;&lt;\"Queue is empty\\n\";<br \/>\n    else<br \/>\n        cout&lt;&lt;\"element at front is:\"&lt;&lt;front->data;<br \/>\n}<br \/>\n\/\/to display queue<br \/>\nvoid display_queue()<br \/>\n{<br \/>\n    if (isempty())<br \/>\n        cout&lt;&lt;\"Queue is empty\\n\";<br \/>\n    else<br \/>\n    {<br \/>\n        Node *ptr = front;<br \/>\n        while( ptr !=NULL)<br \/>\n        {<br \/>\n            cout&lt;&lt;ptr->data&lt;&lt;\" \";<br \/>\n            ptr= ptr->link;<br \/>\n        }<br \/>\n    }<br \/>\n}<br \/>\n\/\/Main Function<br \/>\nint main()<br \/>\n{<br \/>\n    int choice, flag=1, value;<br \/>\n    while( flag )<br \/>\n    {<br \/>\n        cout &lt;&lt; endl &lt;&lt;\"1. Enter into queue\" &lt;&lt; endl &lt;&lt; \"2. Delete queue\" &lt;&lt; endl &lt;&lt;\"3. Show Front\" &lt;&lt; endl &lt;&lt; \"4. Display queue\" &lt;&lt; endl &lt;&lt; \"5. Exit\" &lt;&lt; endl;<br \/>\n        cin>>choice;<br \/>\n        switch (choice)<br \/>\n        {<br \/>\n            case 1: cout&lt;&lt;\"Enter Value:\\n\";<br \/>\n                cin>>value;<br \/>\n                enqueue(value);<br \/>\n                break;<br \/>\n            case 2: dequeue();<br \/>\n                break;<br \/>\n            case 3: peek();<br \/>\n                break;<br \/>\n            case 4: display_queue();<br \/>\n                break;<br \/>\n            case 5: flag = 0;<br \/>\n                break;<br \/>\n        }<br \/>\n }<br \/>\nreturn 0;<br \/>\n}<\/code><\/p>\n<p><small>Microsoft Windows 10 is a widely used operating system in computers all over the world. If you have skills in Microsoft Windows 10 then you can get a <a href=\"https:\/\/www.studysection.com\/windows-10-foundation\">Windows 10 Certification<\/a> from StudySection which can help you in getting hired. A beginner level certification exam for newbies and an advanced level certification exam for experts is available on StudySection.<\/small><\/p>\n","protected":false},"excerpt":{"rendered":"<p>What is Queue? It is a linear structure that follows first in first out ( FIFO) in which the operations<\/p>\n","protected":false},"author":1,"featured_media":5359,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[142,740],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v21.7 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Implementation of Queue with Linked List in C++ - SS Blog<\/title>\n<meta name=\"description\" content=\"Before implementation of Queue with Linked List in C++, there are two major fundamental operations performed on a queue.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Implementation of Queue with Linked List in C++ - SS Blog\" \/>\n<meta property=\"og:description\" content=\"Before implementation of Queue with Linked List in C++, there are two major fundamental operations performed on a queue.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/\" \/>\n<meta property=\"og:site_name\" content=\"Blog Posts on famous people, innovations and educational topics\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/studysection\" \/>\n<meta property=\"article:published_time\" content=\"2021-12-06T04:48:39+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2021-12-09T05:58:06+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/studysection.com\/blog\/wp-content\/uploads\/2021\/12\/Implementation.png\" \/>\n\t<meta property=\"og:image:width\" content=\"300\" \/>\n\t<meta property=\"og:image:height\" content=\"200\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"admin-studysection-blog\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@studysection\" \/>\n<meta name=\"twitter:site\" content=\"@studysection\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"admin-studysection-blog\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/\"},\"author\":{\"name\":\"admin-studysection-blog\",\"@id\":\"https:\/\/studysection.com\/blog\/#\/schema\/person\/db367e2c29a12d1808fb1979edb3d402\"},\"headline\":\"Implementation of Queue with Linked List in C++\",\"datePublished\":\"2021-12-06T04:48:39+00:00\",\"dateModified\":\"2021-12-09T05:58:06+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/\"},\"wordCount\":195,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/studysection.com\/blog\/#organization\"},\"keywords\":[\"C\",\"Queue\"],\"articleSection\":[\"Learn and Grow\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/\",\"url\":\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/\",\"name\":\"Implementation of Queue with Linked List in C++ - SS Blog\",\"isPartOf\":{\"@id\":\"https:\/\/studysection.com\/blog\/#website\"},\"datePublished\":\"2021-12-06T04:48:39+00:00\",\"dateModified\":\"2021-12-09T05:58:06+00:00\",\"description\":\"Before implementation of Queue with Linked List in C++, there are two major fundamental operations performed on a queue.\",\"breadcrumb\":{\"@id\":\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/studysection.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Implementation of Queue with Linked List in C++\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/studysection.com\/blog\/#website\",\"url\":\"https:\/\/studysection.com\/blog\/\",\"name\":\"Blog Posts on famous people, innovations and educational topics\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/studysection.com\/blog\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/studysection.com\/blog\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/studysection.com\/blog\/#organization\",\"name\":\"StudySection\",\"url\":\"https:\/\/studysection.com\/blog\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/studysection.com\/blog\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/studysection.com\/blog\/wp-content\/uploads\/2021\/10\/studySection-logo.png\",\"contentUrl\":\"https:\/\/studysection.com\/blog\/wp-content\/uploads\/2021\/10\/studySection-logo.png\",\"width\":920,\"height\":440,\"caption\":\"StudySection\"},\"image\":{\"@id\":\"https:\/\/studysection.com\/blog\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/studysection\",\"https:\/\/twitter.com\/studysection\",\"https:\/\/www.instagram.com\/study.section\/\",\"https:\/\/www.linkedin.com\/company\/studysection\"]},{\"@type\":\"Person\",\"@id\":\"https:\/\/studysection.com\/blog\/#\/schema\/person\/db367e2c29a12d1808fb1979edb3d402\",\"name\":\"admin-studysection-blog\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/studysection.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/054ac87a6874df1932004239cd8eab36?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/054ac87a6874df1932004239cd8eab36?s=96&d=mm&r=g\",\"caption\":\"admin-studysection-blog\"},\"url\":\"https:\/\/studysection.com\/blog\/author\/admin-studysection-blog\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Implementation of Queue with Linked List in C++ - SS Blog","description":"Before implementation of Queue with Linked List in C++, there are two major fundamental operations performed on a queue.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/","og_locale":"en_US","og_type":"article","og_title":"Implementation of Queue with Linked List in C++ - SS Blog","og_description":"Before implementation of Queue with Linked List in C++, there are two major fundamental operations performed on a queue.","og_url":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/","og_site_name":"Blog Posts on famous people, innovations and educational topics","article_publisher":"https:\/\/www.facebook.com\/studysection","article_published_time":"2021-12-06T04:48:39+00:00","article_modified_time":"2021-12-09T05:58:06+00:00","og_image":[{"width":300,"height":200,"url":"https:\/\/studysection.com\/blog\/wp-content\/uploads\/2021\/12\/Implementation.png","type":"image\/png"}],"author":"admin-studysection-blog","twitter_card":"summary_large_image","twitter_creator":"@studysection","twitter_site":"@studysection","twitter_misc":{"Written by":"admin-studysection-blog","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/#article","isPartOf":{"@id":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/"},"author":{"name":"admin-studysection-blog","@id":"https:\/\/studysection.com\/blog\/#\/schema\/person\/db367e2c29a12d1808fb1979edb3d402"},"headline":"Implementation of Queue with Linked List in C++","datePublished":"2021-12-06T04:48:39+00:00","dateModified":"2021-12-09T05:58:06+00:00","mainEntityOfPage":{"@id":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/"},"wordCount":195,"commentCount":0,"publisher":{"@id":"https:\/\/studysection.com\/blog\/#organization"},"keywords":["C","Queue"],"articleSection":["Learn and Grow"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/","url":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/","name":"Implementation of Queue with Linked List in C++ - SS Blog","isPartOf":{"@id":"https:\/\/studysection.com\/blog\/#website"},"datePublished":"2021-12-06T04:48:39+00:00","dateModified":"2021-12-09T05:58:06+00:00","description":"Before implementation of Queue with Linked List in C++, there are two major fundamental operations performed on a queue.","breadcrumb":{"@id":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/studysection.com\/blog\/implementation-of-queue-with-linked-list-in-c\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/studysection.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Implementation of Queue with Linked List in C++"}]},{"@type":"WebSite","@id":"https:\/\/studysection.com\/blog\/#website","url":"https:\/\/studysection.com\/blog\/","name":"Blog Posts on famous people, innovations and educational topics","description":"","publisher":{"@id":"https:\/\/studysection.com\/blog\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/studysection.com\/blog\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/studysection.com\/blog\/#organization","name":"StudySection","url":"https:\/\/studysection.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/studysection.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/studysection.com\/blog\/wp-content\/uploads\/2021\/10\/studySection-logo.png","contentUrl":"https:\/\/studysection.com\/blog\/wp-content\/uploads\/2021\/10\/studySection-logo.png","width":920,"height":440,"caption":"StudySection"},"image":{"@id":"https:\/\/studysection.com\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/studysection","https:\/\/twitter.com\/studysection","https:\/\/www.instagram.com\/study.section\/","https:\/\/www.linkedin.com\/company\/studysection"]},{"@type":"Person","@id":"https:\/\/studysection.com\/blog\/#\/schema\/person\/db367e2c29a12d1808fb1979edb3d402","name":"admin-studysection-blog","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/studysection.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/054ac87a6874df1932004239cd8eab36?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/054ac87a6874df1932004239cd8eab36?s=96&d=mm&r=g","caption":"admin-studysection-blog"},"url":"https:\/\/studysection.com\/blog\/author\/admin-studysection-blog\/"}]}},"views":1170,"_links":{"self":[{"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/posts\/5358"}],"collection":[{"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/comments?post=5358"}],"version-history":[{"count":3,"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/posts\/5358\/revisions"}],"predecessor-version":[{"id":5361,"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/posts\/5358\/revisions\/5361"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/media\/5359"}],"wp:attachment":[{"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/media?parent=5358"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/categories?post=5358"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studysection.com\/blog\/wp-json\/wp\/v2\/tags?post=5358"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}