How many the Types Of Queues in data structure ?

Sanat Shukla

Total Post:19

Points:135

Posted by  Sanat Shukla
 1014  View(s)
Ratings:
Rate this:

Queues in the data structure.

  1. Re: How many the Types Of Queues in data structure ?

    Linear Queues  –  A queue has two ends, the front end, and the rear end. The QUEUE is a simple data structure, which has FIFO ( First In First Out) property in which Items are removed in the same order as they are entered. The QUEUE has two pointer FRONT and REAR, Item can be pushed by REAR End and can be removed by FRONT End. You can traverse in a linear queue in only one direction i.e. from front to rear.

    How many the Types Of Queues in data structure ?

    Circular Queues  –  It is the different form of a linear queue in which the last position is connected to the first position of the list. A circular queue is similar to linear queue has two ends, the front end, and the rear end. That is the rear end is where we insert elements and front end is where we delete elements. You can traverse in a circular queue in only one direction i.e. from front to rear.

    How many the Types Of Queues in data structure ?

    Double-Ended-Queue   –  This is also a type of queue that we know of as the Double-Ended-Queue, in which entry and deletion are performed at both the front and back ends of the queue. In another word, The double-ended queue also called as deque (pronounced as ‘deck’ or ‘dequeue’) is a list in which the elements can be inserted or deleted at either end in constant time. This is also known as a head-tail linked list because elements can be added to or removed from either the front (head) or the back (tail) end. Whereas, no element can be added and deleted from the middle. Into the computer’s memory, a deque is implemented using either a circular array or a circular doubly linked list. Into a deque, two pointers are maintained, LEFT and RIGHT, which point to either end of the deque. These elements in a deque extend from the LEFT end to the RIGHT end and since it is circular, in a deque of N elements, the nth element of the deque is followed by the first element of the deque. 

    How many the Types Of Queues in data structure ?

      Modified On Sep-10-2019 02:59:44 AM

Answer

Please check, If you want to make this post sponsored

You are not a Sponsored Member. Click Here to Subscribe the Membership.