{"id":146861,"date":"2025-09-17T12:33:03","date_gmt":"2025-09-17T07:03:03","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=146861"},"modified":"2025-09-17T12:33:03","modified_gmt":"2025-09-17T07:03:03","slug":"queue-implementation-using-linked-list-in-dsa-cpp","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/","title":{"rendered":"Queue Implementation using Linked List in DSA C++"},"content":{"rendered":"<h3>Program 1<\/h3>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">\/\/ Queue Linked List\r\n#include&lt;iostream&gt;\r\n#include&lt;stdio.h&gt;\r\nusing namespace std;\r\nclass Node\r\n{\r\n    int data;\r\n    Node *add;\r\n    public:\r\n    void create();\r\n    void insert();\r\n    void delete1();\r\n    void display();\r\n};\r\nNode *start=NULL,*new1,*temp,*prev1;\r\nvoid Node::create()\r\n{\r\n      int n;\r\n      char choice;\r\n      cout&lt;&lt;\"\\n Enter an element: \";\r\n      cin&gt;&gt;n;\r\n      start=new Node();\r\n      start-&gt;data=n;\r\n      start-&gt;add=NULL;\r\n      temp=start;\r\n      cout&lt;&lt;\"\\n Want to continue(Y\/y): \";\r\n      cin&gt;&gt;choice;\r\n      while(choice=='y' || choice=='Y')\r\n      {\r\n          cout&lt;&lt;\"\\n Enter next element: \";\r\n         cin&gt;&gt;n; \r\n         new1=new Node();\r\n         new1-&gt;data=n;\r\n         new1-&gt;add=NULL;\r\n         temp-&gt;add=new1;\r\n         temp=temp-&gt;add;\r\n         cout&lt;&lt;\"\\n Want to continue(Y\/y): \";\r\n         cin&gt;&gt;choice;\r\n      }\r\n}\r\nvoid Node::display()\r\n{\r\n       if(start==NULL)\r\n       cout&lt;&lt;\"\\n List is empty\";\r\n       else\r\n       {\r\n            temp=start;\r\n            while(temp!=NULL)\r\n            {\r\n                cout&lt;&lt;temp-&gt;data&lt;&lt;\"    \";\r\n                temp=temp-&gt;add;\r\n            }\r\n       }\r\n}\r\nvoid Node::insert()\r\n{\r\n    int n;\r\n    if(start==NULL)\r\n        cout&lt;&lt;\"\\n Queue not found\";\r\n    else\r\n    {\r\n        cout&lt;&lt;\"Enter an element: \";\r\n        cin&gt;&gt;n;\r\n        new1=new Node();\r\n        new1-&gt;data=n;\r\n        new1-&gt;add=NULL;\r\n        temp=start;\r\n        while(temp-&gt;add!=NULL)\r\n           temp=temp-&gt;add;\r\n        temp-&gt;add=new1;\r\n    }    \r\n    \r\n}\r\nvoid Node::delete1()\r\n{\r\n    int n;\r\n    if(start==NULL)\r\n        cout&lt;&lt;\"\\n Queue not found\";\r\n    else\r\n    {\r\n          temp=start;\r\n          start=start-&gt;add;\r\n          cout&lt;&lt;\"\\n Deleted element  from queue is: \"&lt;&lt;temp-&gt;data;\r\n          delete temp;\r\n    }\r\n}\r\n\r\nint main()\r\n{\r\n    Node obj;\r\n    system(\"cls\");\r\n    int ch;\r\n  do\r\n  {\r\n     cout&lt;&lt;\"\\n ----------------Queue Linked List-------------------\";\r\n    cout&lt;&lt;\"\\n 1. Create Queue\";\r\n    cout&lt;&lt;\"\\n 2. Insert\";\r\n    cout&lt;&lt;\"\\n 3. Delete\";\r\n    cout&lt;&lt;\"\\n 4. Display\";\r\n    cout&lt;&lt;\"\\n 5. Exit\";\r\n    cout&lt;&lt;\"\\n--------------------------------------------------------\";\r\n    cout&lt;&lt;\"\\n Enter your choice: \";\r\n     cin&gt;&gt;ch;\r\n     switch(ch)\r\n     {\r\n        case 1: obj.create();break;\r\n        case 2: obj.insert();break;\r\n        case 3:obj.delete1();break;\r\n        case 4:obj.display();break;\r\n        case 5:break;\r\n     }\r\n    }while(ch!=5);\r\n\r\n    return 0;\r\n}<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Program 1 \/\/ Queue Linked List #include&lt;iostream&gt; #include&lt;stdio.h&gt; using namespace std; class Node { int data; Node *add; public: void create(); void insert(); void delete1(); void display(); }; Node *start=NULL,*new1,*temp,*prev1; void Node::create() { int&#46;&#46;&#46;<\/p>\n","protected":false},"author":581,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31449],"tags":[32874,32869,32870,35305,35308,35307,35304,35253,35306,35303],"class_list":["post-146861","post","type-post","status-publish","format-standard","hentry","category-dsa-cpp-tutorials","tag-dsa-c","tag-dsa-c-practical","tag-dsa-c-program","tag-dsa-c-queue-using-linked-list","tag-queue-implementation-using-linked-list","tag-queue-implementation-using-linked-list-in-c","tag-queue-implementation-using-linked-list-in-dsa-c","tag-queue-using-linked-list","tag-queue-using-linked-list-in-c","tag-queue-using-linked-list-in-dsa-c"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Queue Implementation using Linked List in DSA C++ - DataFlair<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Queue Implementation using Linked List in DSA C++ - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/ Queue Linked List #include&lt;iostream&gt; #include&lt;stdio.h&gt; using namespace std; class Node { int data; Node *add; public: void create(); void insert(); void delete1(); void display(); }; Node *start=NULL,*new1,*temp,*prev1; void Node::create() { int&#046;&#046;&#046;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/\" \/>\n<meta property=\"og:site_name\" content=\"DataFlair\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/DataFlairWS\/\" \/>\n<meta property=\"article:published_time\" content=\"2025-09-17T07:03:03+00:00\" \/>\n<meta name=\"author\" content=\"DataFlair Team\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:site\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"DataFlair Team\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Queue Implementation using Linked List in DSA C++ - DataFlair","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:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/","og_locale":"en_US","og_type":"article","og_title":"Queue Implementation using Linked List in DSA C++ - DataFlair","og_description":"Program 1 \/\/ Queue Linked List #include&lt;iostream&gt; #include&lt;stdio.h&gt; using namespace std; class Node { int data; Node *add; public: void create(); void insert(); void delete1(); void display(); }; Node *start=NULL,*new1,*temp,*prev1; void Node::create() { int&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2025-09-17T07:03:03+00:00","author":"DataFlair Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"DataFlair Team","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/"},"author":{"name":"DataFlair Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445"},"headline":"Queue Implementation using Linked List in DSA C++","datePublished":"2025-09-17T07:03:03+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/"},"wordCount":10,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["dsa c++","dsa c++ practical","dsa c++ program","dsa c++ queue using linked list","queue implementation using linked list","queue implementation using linked list in c++","queue implementation using linked list in dsa c++","queue using linked list","queue using linked list in c++","queue using linked list in dsa c++"],"articleSection":["DSA using C++ Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/","url":"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/","name":"Queue Implementation using Linked List in DSA C++ - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2025-09-17T07:03:03+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/queue-implementation-using-linked-list-in-dsa-cpp\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"DSA using C++ Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/dsa-cpp-tutorials\/"},{"@type":"ListItem","position":3,"name":"Queue Implementation using Linked List in DSA C++"}]},{"@type":"WebSite","@id":"https:\/\/data-flair.training\/blogs\/#website","url":"https:\/\/data-flair.training\/blogs\/","name":"DataFlair","description":"Learn Today. Lead Tomorrow.","publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/data-flair.training\/blogs\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/data-flair.training\/blogs\/#organization","name":"DataFlair","url":"https:\/\/data-flair.training\/blogs\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","width":106,"height":48,"caption":"DataFlair"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/DataFlairWS\/","https:\/\/x.com\/DataFlairWS","https:\/\/www.linkedin.com\/company\/dataflair-web-services-pvt-ltd\/","https:\/\/www.youtube.com\/user\/DataFlairWS"]},{"@type":"Person","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445","name":"DataFlair Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","caption":"DataFlair Team"},"description":"DataFlair Team provides high-impact content on programming, Java, Python, C++, DSA, AI, ML, data Science, Android, Flutter, MERN, Web Development, and technology. We make complex concepts easy to grasp, helping learners of all levels succeed in their tech careers.","url":"https:\/\/data-flair.training\/blogs\/author\/dfteam6\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146861","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/users\/581"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=146861"}],"version-history":[{"count":2,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146861\/revisions"}],"predecessor-version":[{"id":146871,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146861\/revisions\/146871"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=146861"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=146861"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=146861"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}