![]() The following algorithm describes the enqueue() operation in a simpler way. The enqueue() is a data manipulation operation that is used to insert elements into the stack. The front pointer accesses the data from the front end (helping in enqueueing) while the rear pointer accesses data from the rear end (helping in dequeuing). Queue uses two pointers − front and rear. These are all built-in operations to carry out data manipulation and to check the status of the queue. The most fundamental operations in the queue ADT include: enqueue(), dequeue(), peek(), isFull(), isEmpty(). Queue operations also include initialization of a queue, usage and permanently deleting the data from the memory. As a small example in this tutorial, we implement queues using a one-dimensional array. ![]() Similar to the stack ADT, a queue ADT can also be implemented using arrays, linked lists, or pointers. ![]() More real-world examples can be seen as queues at the ticket windows and bus-stops. The data is inserted into the queue through one end and deleted from it using the other end.Ī real-world example of queue can be a single-lane one-way road, where the vehicle enters first, exits first. the data item inserted first will also be accessed first. Hence, it follows FIFO (First-In-First-Out) structure, i.e. The thing that makes queue different from stack is that a queue is open at both its ends. Queue, like Stack, is also an abstract data structure.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |