Logo 
Search:

C++ Programming Articles

Submit Article
Home » Articles » C++ Programming » Data File StructureRSS Feeds

Defines queue and priority queues. Lists basic operations and properties of queue. Also lists types of priority queue.

Posted By: Bogart Fischer     Category: C++ Programming     Views: 8539

This article defines queue and priority queue. It also lists basic operations and properties of a queue. It also lists types of priority queue.

Queues

A queue is a list in which insertion can be perform at rare end of queue and deletion can be perform from front end of queue.  It’s basically works on act of FIFO (First in, First out).

Basic Operations on Queue

-  Insert
-  Delete
-  Top (Returns topmost element of queue)
-  IsEmpty (Which returns TRUE if queue is empty)

Properties of Queue

-  Insertion is at last and Deletion is of first element from the list.
-  Top of queue points to first in element.
-  Queue can be static or dynamic in size.
-  The indexing of particular element of queue depends on the basic list which we have use to implement it.

Priority Queues

A queue in which we are able to insert items or remove items from any position based on some priority is called priority queue.

Two types of Priority Queues

-  Input according to priority
-  Output according to priority

  
Share: 



Bogart Fischer
Bogart Fischer author of Defines queue and priority queues. Lists basic operations and properties of queue. Also lists types of priority queue. is from Frankfurt, Germany.
 
View All Articles

 
Please enter your Comment

  • Comment should be atleast 30 Characters.
  • Please put code inside [Code] your code [/Code].

 
No Comment Found, Be the First to post comment!