An airport is developing a computer simulation of air-traffic control that handl

Question

An airport is developing a computer simulation of air-traffic control that handles events such as landings and takeoffs. Each even has a time-stamp that denotes the time when the event occurs. The simulation program needs to efficiently perform the following two fundamental operations:

Insert an even 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 efficient time in insertion and deletion you should use binary search tree data structure . both operation can be done in log n time with this data structure

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

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