1.2. Use Case: Air Traffic Control

Try these first

1. 1.

   What is a min-heap?

   Hint

   Think about the root element in a tree.

2. 2.

   Explain what a priority queue does.

   Hint

   Consider how flight requests are handled.

3. 3.

   What is the primary function of a min-heap in air traffic control?

   • To manage maximum requests
   • To ensure the earliest flight is processed first
   • To prioritize ground traffic

   Hint

   Think about how requests are prioritized.

4. 4.

   True or False: A binary search tree always keeps its elements in sorted order.

   • True
   • False

   Hint

   Consider what happens during an in-order traversal.

5. 5.

   Consider a situation where 10 different flights request takeoff and landing in a short time frame. Create a data structure that would effectively manage these requests while implementing a separation time of 3 minutes between each.

   Hint

   Think about how BSTs can help both in sorting and searching.

6. 6.

   How would the efficiency of your system change if instead of a binary search tree, you used an unsorted array? Discuss the performance implications.

   Hint

   Reflect on how the ordering of data impacts the operations.