{"id":26991,"date":"2018-01-02T20:32:21","date_gmt":"2018-01-02T15:02:21","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26991"},"modified":"2018-01-02T20:32:21","modified_gmt":"2018-01-02T15:02:21","slug":"queue-data-structure-deque","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/queue-data-structure-deque\/","title":{"rendered":"Queue-Data Structure-Deque"},"content":{"rendered":"

Deque or Double Ended Queue<\/a> is a generalized version of Queue data structure <\/a>that allows insert and delete at both ends.<\/span><\/p>\n

Operations on Deque:<\/strong>
\nMainly the following four basic operations are performed on queue:<\/p>\n

insetFront()<\/strong>: Adds an item at the front of Deque.
\ninsertLast()<\/strong>:Adds an item at the rear of Deque.
\ndeleteFront()<\/strong>: Deletes an item from front of Deque.
\ndeleteLast()<\/strong>: Deletes an item from rear of Deque.<\/p>\n

In addition to above operations, following operations are also supported
\ngetFront()<\/strong>: Gets the front item from queue.
\ngetRear()<\/strong>: Gets the last item from queue.
\nisEmpty()<\/strong>: Checks whether Deque is empty or not.
\nisFull()<\/strong>: Checks whether Deque is full or not.<\/p>\n[ad type=”banner”]\n

Applications of Deque:<\/strong>
\nSince Deque supports both stack and queue operations, it can be used as both. The Deque data structure supports clockwise and anticlockwise rotations in O(1) time which can be useful in certain applications.
\nAlso, the problems where elements need to be removed and or added both ends can be efficiently solved using Deque. For example see Maximum of all subarrays of size k problem.<\/a>, 0-1 BFS<\/a> and Find the first circular tour that visits all petrol pumps<\/a>.<\/p>\n

See wiki page <\/a>for another example of A-Steal job scheduling algorithm where Deque is used as deletions operation is required at both ends.<\/p>\n

Language Support:<\/strong>
\nC++ STL provides implementation of Deque as std::deque<\/a> and Java provides Deque interface<\/a>. See this <\/a>for more details.<\/p>\n

Implementation:<\/strong>
\nA Deque can be implemented either using a doubly linked list<\/a> or circular array. In both implementation, we can implement all operations in O(1) time. We will soon be discussing C\/C++ implementation of Deque Data structure.<\/p>\n


\nImplementation of Deque using circular array<\/a>
\n<\/strong>
\nPlease write comments if you find the above codes\/algorithms incorrect, or find other ways to solve the same problem.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"

Queue Data Structure Deque – Data Structure – Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[73012,80124],"tags":[83808,83804,83806,83807,83803,83805,83810,83809,83799,83795,83796,83800,83801,83797,83802,83798],"class_list":["post-26991","post","type-post","status-publish","format-standard","hentry","category-data-structures","category-queue","tag-deque-c","tag-deque-example","tag-deque-geeksforgeeks","tag-deque-implementation","tag-deque-in-c","tag-deque-meaning","tag-deque-pronunciation","tag-deque-vs-vector","tag-dequeue-geeksforgeeks","tag-dequeue-in-data-structure","tag-dequeue-in-data-structure-using-c","tag-double-ended-queue-applications","tag-double-ended-queue-in-data-structure-pdf","tag-double-ended-queue-in-data-structure-with-example","tag-enqueue-in-data-structure","tag-input-restricted-deque"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26991","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26991"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26991\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26991"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26991"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26991"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}