Binary search tree

Suppose you are a developer in a software company which has got the contract to develop an
airport runway reservation system. Currently you are working on a system that has only one
runway as part of the airport. The reservation system is going to work over a 24 hour time
format.
Your system should allow the reservations for half an hour intervals, if the runway is available for
requested time slots for landing or take off.
Housekeeping points
● This is a minimal example and may not follow some standard practices.
● We focus on the main flow, and not much error handling.
Program Organization
The simple program is structured in various layers.
1. runway_reservation_system.py: In this python file there are two classes designed.
Class Node is used to create the tree nodes for the BST. Other class is created named
as runway_bst that will have implementation of different methods such as insert,
make_reservation, runway_busy and validate interval. These methods are designed to
perform specific operations. The implementation for these methods and related
information is mentioned in the next section.
Problem Statement
In the given python file you have to implement the incomplete methods. These methods and
their behavior is mentioned following:
1. (Mandatory) Add code for make_reservation()
a. You have to implement the above mentioned method. This method is supposed
to be called from the driver code. This method will insert the data after validating
two operations.
i. make_reservation: Each plane can book the available slot of the runway
for only 30 minutes. If any request comes for more or less than that then
the request will be denied. For the error message look at the
runway_system.txt. This method will also check if the runway is free
during the asked time by calling the runway_busy method. After verifying
that runway is available you can perform the insert operation.
ii. runway_busy: This method is supposed to check if the runway is available
for booking in the given duration and there is no overlapping. This
condition should be checked only after validating the interval.
iii. insert: This is the underlying method behind the reservation making
method. The behavior of insert method is similar to the BST insert
operation where by comparing the key with the root value, the ideal
position for the node will be identified. After that the new node will be
inserted in that position.