GeekInterview.com
   Home |  Tech FAQ  |   Interview Questions |  Placement Papers |  Tech Articles |  Learn |  Freelance Projects |  Online Testing |  Geeks Talk |  Job Postings |  Knowledge Base | Site Search |  Add/Ask Question

  GeekInterview.com  >  Interview Questions  >  Concepts  >  Data Structures

 Print  |  
Question:  Priority Queue

Answer: What is Priority Queue? Explain with example.


August 08, 2009 09:04:11 #2
 ravi6771   Member Since: August 2009    Total Comments: 3 

RE: Priority Queue
 
Heap is also called a priority queue. Heaps are of two types one is min heap and other is max heap. Min heap contains min at the top of tree.
     

 

Back To Question