{"id":135417,"date":"2024-05-25T16:03:12","date_gmt":"2024-05-25T10:33:12","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=135417"},"modified":"2024-05-25T16:03:12","modified_gmt":"2024-05-25T10:33:12","slug":"priority-queue-in-data-structures-using-cpp","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/","title":{"rendered":"Priority Queue in Data Structures using C++"},"content":{"rendered":"<h3>Program 1<\/h3>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">\/\/ Priority Queue\r\n#include&lt;iostream&gt;\r\n#include&lt;stdio.h&gt;\r\n#define clrscr() system(\"cls\")\r\nusing namespace std;\r\nclass node\r\n{\r\n    public:\r\n    int data;\r\n    int p;\r\n    node *add;\r\n};\r\nnode *start=NULL,*new1,*temp;\r\nvoid create();\r\nvoid insert();\r\nvoid display();\r\nvoid delete1();\r\nint main()\r\n{\r\n     int choice;\r\n     clrscr();\r\n   do\r\n  {  \r\n     cout&lt;&lt;\"\\n-----------------Priority Queue---------------------\";\r\n     cout&lt;&lt;\"\\n 1. Create\";\r\n     cout&lt;&lt;\"\\n 2. Display\";\r\n     cout&lt;&lt;\"\\n 3. Insert\";\r\n     cout&lt;&lt;\"\\n 4. Delete\";\r\n     cout&lt;&lt;\"\\n 5. Exit\";\r\n     cout&lt;&lt;\"\\n------------------------------------------------------\";\r\n     cout&lt;&lt;\"\\nEnter your choice\";\r\n     cin&gt;&gt;choice;\r\n     switch(choice)\r\n     {\r\n        case 1:create();break;\r\n        case 2:display();break;\r\n        case 3:insert();break;\r\n        case 4:delete1();break;\r\n        case 5:break;\r\n        default:cout&lt;&lt;\"\\nInvalid choice\";\r\n     }\r\n  }while(choice!=5);  \r\n}\r\nvoid create()\r\n{\r\n    int n,pr;\r\n    char ch;\r\n    cout&lt;&lt;\"\\nEnter an element\";\r\n    cin&gt;&gt;n;\r\n    cout&lt;&lt;\"\\n Enter priority of node\";\r\n    cin&gt;&gt;pr;\r\n    start=new node;\r\n    start-&gt;data=n;\r\n    start-&gt;p=pr;\r\n    start-&gt;add=NULL;\r\n    temp=start;\r\n    cout&lt;&lt;\"\\n Want to continue\";\r\n    cin&gt;&gt;ch;\r\n    while(ch=='y' || ch=='Y')\r\n    {\r\n        cout&lt;&lt;\"\\n Enter next element\";\r\n        cin&gt;&gt;n;\r\n         cout&lt;&lt;\"\\n Enter priority of node\";\r\n         cin&gt;&gt;pr;\r\n         new1=new node;\r\n         new1-&gt;data=n;\r\n         new1-&gt;p=pr;\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\";\r\n        cin&gt;&gt;ch;     \r\n    }\r\n\r\n}\r\nvoid display()\r\n{\r\n     if(start==NULL)\r\n       cout&lt;&lt;\"Queue not found.....\";\r\n     else\r\n     {\r\n        cout&lt;&lt;\"\\nElement of Queue\\n\";\r\n        temp=start;\r\n        while(temp!=NULL)\r\n        {\r\n            cout&lt;&lt;\" Data=\"&lt;&lt;temp-&gt;data &lt;&lt;\" Priorty=\"&lt;&lt;temp-&gt;p;\r\n            temp=temp-&gt;add;\r\n        }\r\n        \/\/ cout&lt;&lt;\"\\nPriority of Node\\n\";\r\n        \/\/ temp=start;\r\n        \/\/ while(temp!=NULL)\r\n        \/\/ {\r\n        \/\/     cout&lt;&lt;\"  \"&lt;&lt;temp-&gt;p;\r\n        \/\/     temp=temp-&gt;add;\r\n        \/\/ }\r\n     }  \r\n}\r\nvoid insert()\r\n{\r\n     cout&lt;&lt;\"This is insert\";\r\n}\r\nvoid delete1()\r\n{\r\n     cout&lt;&lt;\"This is delete\";\r\n     \r\n}<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Program 1 \/\/ Priority Queue #include&lt;iostream&gt; #include&lt;stdio.h&gt; #define clrscr() system(&#8220;cls&#8221;) using namespace std; class node { public: int data; int p; node *add; }; node *start=NULL,*new1,*temp; void create(); void insert(); void display(); void delete1();&#46;&#46;&#46;<\/p>\n","protected":false},"author":86671,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31449],"tags":[32265,32249,32251,32267,32269,32268,32270],"class_list":["post-135417","post","type-post","status-publish","format-standard","hentry","category-dsa-cpp-tutorials","tag-data-structures-using-c","tag-dsa-using-c","tag-dsa-using-c-practical","tag-dsa-using-c-project","tag-priority-queue","tag-priority-queue-in-dsa-using-c","tag-priority-queue-in-dsa-with-c"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Priority Queue in Data Structures using 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\/priority-queue-in-data-structures-using-cpp\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Priority Queue in Data Structures using C++ - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/ Priority Queue #include&lt;iostream&gt; #include&lt;stdio.h&gt; #define clrscr() system(&quot;cls&quot;) using namespace std; class node { public: int data; int p; node *add; }; node *start=NULL,*new1,*temp; void create(); void insert(); void display(); void delete1();&#046;&#046;&#046;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-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=\"2024-05-25T10:33:12+00:00\" \/>\n<meta name=\"author\" content=\"TechVidvan 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=\"TechVidvan 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":"Priority Queue in Data Structures using 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\/priority-queue-in-data-structures-using-cpp\/","og_locale":"en_US","og_type":"article","og_title":"Priority Queue in Data Structures using C++ - DataFlair","og_description":"Program 1 \/\/ Priority Queue #include&lt;iostream&gt; #include&lt;stdio.h&gt; #define clrscr() system(\"cls\") using namespace std; class node { public: int data; int p; node *add; }; node *start=NULL,*new1,*temp; void create(); void insert(); void display(); void delete1();&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2024-05-25T10:33:12+00:00","author":"TechVidvan Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"TechVidvan Team","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/"},"author":{"name":"TechVidvan Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/0e594f928e31fc96628ac40f6ae74f49"},"headline":"Priority Queue in Data Structures using C++","datePublished":"2024-05-25T10:33:12+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/"},"wordCount":9,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["data structures using c++","dsa using c++","dsa using c++ practical","dsa using c++ project","priority queue","priority queue in dsa using c++","priority queue in dsa with c++"],"articleSection":["DSA using C++ Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/","url":"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/","name":"Priority Queue in Data Structures using C++ - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2024-05-25T10:33:12+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-cpp\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/priority-queue-in-data-structures-using-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":"Priority Queue in Data Structures using 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\/0e594f928e31fc96628ac40f6ae74f49","name":"TechVidvan Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/c89190da3d4010c71ba476b618ab10fdc2335c82cdfa0ad5002d98d0f2473444?s=96&d=mm&r=g","caption":"TechVidvan Team"},"description":"TechVidvan Team provides high-quality content &amp; courses on AI, ML, Data Science, Data Engineering, Data Analytics, programming, Python, DSA, Android, Flutter, full stack web dev, MERN, and many latest technology.","url":"https:\/\/data-flair.training\/blogs\/author\/test001\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135417","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\/86671"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=135417"}],"version-history":[{"count":4,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135417\/revisions"}],"predecessor-version":[{"id":142562,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/135417\/revisions\/142562"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=135417"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=135417"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=135417"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}