Heaps and Priorities Queues in C++ An airport is developing a computer simulatio

Question

Heaps and Priorities Queues in C++

An airport is developing a computer simulation of air-trafc control that handles events such as landings and takeoffs. Each event has a time-stamp that denotes the time when the event occurs.

The simulation program needs to efciently perform the following two fundamental operations:

Insert an event with a given time-stamp (that is, add a future event)

Extract the event with smallest time-stamp (that is, determine the next event to process)

Which data structure should be used for the above operations? Why?

Explanation / Answer

For that problem, we can you Binary Search Tree, AVL tree etc.
If we will you Binary tree than It will take O(n) time if the tree of element will be skewed in one side. so that to solve that issue , AVL tree can be used. It will take O(logn) always to search.

Insert event will take at most O(logn) in AVL tree so that it will be smallest time taken by any data structure. If plan need to land than we need a gap beteen two landing. It will be better to find the smallest gap. so that AVL tree is best for air-traffic application.

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.