https://github.com/foo290/runway-reservation-scheduler
Airline runway reservation scheduler using augmented BST.
https://github.com/foo290/runway-reservation-scheduler
Last synced: over 1 year ago
JSON representation
Airline runway reservation scheduler using augmented BST.
- Host: GitHub
- URL: https://github.com/foo290/runway-reservation-scheduler
- Owner: foo290
- License: mit
- Created: 2021-07-17T07:11:07.000Z (almost 5 years ago)
- Default Branch: main
- Last Pushed: 2021-07-29T13:11:48.000Z (almost 5 years ago)
- Last Synced: 2025-01-06T21:47:44.051Z (over 1 year ago)
- Language: C++
- Size: 9.77 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# runway-reservation-scheduler
### Source: MIT Lecture 5, Unit 2 : Sorting and trees
[Video Resource](https://www.youtube.com/watch?v=9Jry5-82I68) ,
[Lecture Notes](https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/lecture-notes/)
Runway reservation scheduling is a scheduling problem which needs a data structure for fast insertion and deletion, thus
BSTs are best for this type of problem.
**Problem Statement:**
Design a data structure for a **Real life Scenario** of a runway reservation system.
which should be able to handle :
* Each request will come with a time of landing, on which the plane is suppose to be land.
* Make sure each landing are `k` Minutes away from each other. Call this `K minutes check`.
* for example
* If k=3, and there is a landing scheduled in next 5 mins, then there should not be a landing in next 4 mins or 6 mmins (as the k min check will fail).
* For a given time `t`, show all the landing scheduled for `t` and after it.
* Each time you delete a node or insert a node, the no. of landings must be managed in recursive calls.
### For detailed explanation, watch the [video](https://www.youtube.com/watch?v=9Jry5-82I68).