{"id":143199,"date":"2024-08-14T15:24:46","date_gmt":"2024-08-14T09:54:46","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=143199"},"modified":"2024-08-14T15:24:46","modified_gmt":"2024-08-14T09:54:46","slug":"deque-in-dsa-using-cpp","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/deque-in-dsa-using-cpp\/","title":{"rendered":"Deque in DSA using C++"},"content":{"rendered":"<h3>Program 1<\/h3>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">#include&lt;iostream&gt;\r\n#include&lt;stdio.h&gt;\r\n#define clrscr() system(\"cls\")\r\nusing namespace std;\r\n#define MAXSIZE 10\r\nint dqueue[MAXSIZE];\r\nint front=-1,rear=-1;\r\nvoid insertFront();\r\nvoid insertRear();\r\nvoid deleteFront();\r\nvoid deleteRear();\r\nvoid display();\r\nint main()\r\n{\r\n     int choice;\r\n do\r\n {    \r\n   cout&lt;&lt;\"\\n-----------------DQueue Menu---------------------\\n\";\r\n   cout&lt;&lt;\"\\n 1. Insert Front\";\r\n   cout&lt;&lt;\"\\n 2. Insert Rear\";\r\n   cout&lt;&lt;\"\\n 3. Delete Front\";\r\n   cout&lt;&lt;\"\\n 4. Delete Rear\";\r\n   cout&lt;&lt;\"\\n 5. Display\";\r\n   cout&lt;&lt;\"\\n 6. Exit\";\r\n   cout&lt;&lt;\"\\n-------------------------------------------------------\\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:insertFront();break;\r\n        case 2:insertRear();break;\r\n        case 3: deleteFront();break;\r\n        case 4:deleteRear();break;\r\n        case 5:display();break;\r\n        case 6:break; \r\n    }\r\n }while(choice!=6); \r\n   return 0;\r\n}\r\nvoid insertFront()\r\n{\r\n      int n;\r\n    if((front==0 &amp;&amp; rear==MAXSIZE-1) ||(front==rear+1))\r\n        cout&lt;&lt;\"\\n Dqueue is overflow\";\r\n    else\r\n    {\r\n          cout&lt;&lt;\"\\n Enter an element for insert front\";\r\n          cin&gt;&gt;n;\r\n          if(front==-1 &amp;&amp; rear==-1)\r\n          {\r\n              front=rear=0;\r\n              dqueue[front]=n; \r\n          }\r\n          else if(front==0)\r\n          {\r\n              front=MAXSIZE-1;\r\n              dqueue[front]=n;\r\n          }\r\n          else\r\n          {\r\n             front--;\r\n             dqueue[front]=n;\r\n          }\r\n    }    \r\n}\r\nvoid insertRear()\r\n{\r\n     int n;\r\n    if((front==0 &amp;&amp; rear==MAXSIZE-1) ||(front==rear+1))\r\n        cout&lt;&lt;\"\\n Dqueue is overflow\";\r\n    else\r\n    {\r\n          cout&lt;&lt;\"\\n Enter an element for insert rear\";\r\n          cin&gt;&gt;n;\r\n          if(front==-1 &amp;&amp; rear==-1)\r\n          {\r\n              front=rear=0;\r\n              dqueue[rear]=n;\r\n          }\r\n          else if(rear==MAXSIZE-1)\r\n            {\r\n                  rear=0;\r\n                  dqueue[rear]=n;\r\n            }\r\n            else\r\n            {\r\n                rear++;\r\n                dqueue[rear]=n;\r\n            }\r\n    }    \r\n}\r\nvoid deleteFront()\r\n{\r\n  if(front==-1 &amp;&amp; rear==-1)\r\n     cout&lt;&lt;\"Queue is Empty\";\r\n  else\r\n  {\r\n        if(front==rear)\r\n           front=rear=-1;\r\n        else\r\n        if(front==MAXSIZE-1)   \r\n        {\r\n              cout&lt;&lt;\"\\n Deleted element is: \"&lt;&lt;dqueue[front];\r\n              front=0;\r\n        }\r\n        else\r\n        {\r\n             cout&lt;&lt;\"\\n Deleted element is: \"&lt;&lt;dqueue[front];\r\n             front++; \r\n        }\r\n  } \r\n\r\n}\r\nvoid deleteRear()\r\n{\r\n    if(front==-1 &amp;&amp; rear==-1)\r\n       cout&lt;&lt;\"Queue is Empty\";\r\n  else\r\n  {\r\n        if(front==rear)\r\n           front=rear=-1;\r\n        else\r\n        {\r\n            if(rear==0)\r\n            {\r\n                cout&lt;&lt;\"\\n Delete element is : \"&lt;&lt;dqueue[rear];\r\n                rear=MAXSIZE-1;\r\n            }\r\n            else\r\n            {\r\n                cout&lt;&lt;\"\\n Delete element is : \"&lt;&lt;dqueue[rear];\r\n                rear--;\r\n            }\r\n        }   \r\n  }       \r\n\r\n}\r\nvoid display()\r\n{\r\n   if(front==-1 &amp;&amp; rear==-1)\r\n   {\r\n        cout&lt;&lt;\"Queue is Empty\";\r\n   }\r\n   else\r\n   {\r\n        int i;\r\n        i=front;\r\n        while(i!=rear)\r\n        {\r\n            cout&lt;&lt;\"   \"&lt;&lt;dqueue[i];\r\n            i=(i+1)%MAXSIZE;\r\n        }\r\n            cout&lt;&lt;\"   \"&lt;&lt;dqueue[rear];\r\n   }\r\n}<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Program 1 #include&lt;iostream&gt; #include&lt;stdio.h&gt; #define clrscr() system(&#8220;cls&#8221;) using namespace std; #define MAXSIZE 10 int dqueue[MAXSIZE]; int front=-1,rear=-1; void insertFront(); void insertRear(); void deleteFront(); void deleteRear(); void display(); int main() { int choice; do {&#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":[32862,32887,32886,32874,32869,32870,32888,32249],"class_list":["post-143199","post","type-post","status-publish","format-standard","hentry","category-dsa-cpp-tutorials","tag-deque","tag-deque-in-dsa-c","tag-deque-in-dsa-using-c","tag-dsa-c","tag-dsa-c-practical","tag-dsa-c-program","tag-dsa-c-program-on-deque","tag-dsa-using-c"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Deque in DSA 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\/deque-in-dsa-using-cpp\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Deque in DSA using C++ - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 #include&lt;iostream&gt; #include&lt;stdio.h&gt; #define clrscr() system(&quot;cls&quot;) using namespace std; #define MAXSIZE 10 int dqueue[MAXSIZE]; int front=-1,rear=-1; void insertFront(); void insertRear(); void deleteFront(); void deleteRear(); void display(); int main() { int choice; do {&#046;&#046;&#046;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/deque-in-dsa-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-08-14T09:54:46+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":"Deque in DSA 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\/deque-in-dsa-using-cpp\/","og_locale":"en_US","og_type":"article","og_title":"Deque in DSA using C++ - DataFlair","og_description":"Program 1 #include&lt;iostream&gt; #include&lt;stdio.h&gt; #define clrscr() system(\"cls\") using namespace std; #define MAXSIZE 10 int dqueue[MAXSIZE]; int front=-1,rear=-1; void insertFront(); void insertRear(); void deleteFront(); void deleteRear(); void display(); int main() { int choice; do {&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/deque-in-dsa-using-cpp\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2024-08-14T09:54:46+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\/deque-in-dsa-using-cpp\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/deque-in-dsa-using-cpp\/"},"author":{"name":"DataFlair Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445"},"headline":"Deque in DSA using C++","datePublished":"2024-08-14T09:54:46+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/deque-in-dsa-using-cpp\/"},"wordCount":7,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["deque","deque in dsa c++","deque in dsa using c++","dsa c++","dsa c++ practical","dsa c++ program","dsa c++ program on deque","dsa using c++"],"articleSection":["DSA using C++ Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/deque-in-dsa-using-cpp\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/deque-in-dsa-using-cpp\/","url":"https:\/\/data-flair.training\/blogs\/deque-in-dsa-using-cpp\/","name":"Deque in DSA using C++ - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2024-08-14T09:54:46+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/deque-in-dsa-using-cpp\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/deque-in-dsa-using-cpp\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/deque-in-dsa-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":"Deque in DSA 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\/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\/143199","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=143199"}],"version-history":[{"count":1,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/143199\/revisions"}],"predecessor-version":[{"id":143200,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/143199\/revisions\/143200"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=143199"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=143199"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=143199"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}