1.3. Priority Queue and Min Heap

Try these first

1. 1.

   What is a min heap?

   Hint

   Think about how it manages the smallest values.

2. 2.

   Why are priority queues important in air traffic control?

   Hint

   Consider the consequences of mismanaged requests.

3. 3.

   What is the primary purpose of a priority queue?

   • To store data in order
   • To process requests based on priority
   • To delete the maximum element

   Hint

   Think of how it’s used in scheduling tasks.

4. 4.

   True or False: A min heap always places the largest element at the root.

   • True
   • False

   Hint

   Reverse your expectations about min and max.

5. 5.

   If you were to design a system to prioritize landing requests for multiple airports, how would you structure the data? What factors would you take into account?

   Hint

   Think about unique constraints from multiple airfields.

6. 6.

   Given a dataset of flight requests, develop an algorithm to insert them into a priority queue and maintain minimum separation efficiently.

   Hint

   Consider creating a helper function for checking overlaps.