In c++ using a binary search tree

Applications of BST Consider the plan-landing problem we have discussed in the class where an airport has one runway and planes request landing. Constraints is that runway request will be granted only if there is a K time gap from either side of the landing request. For example, suppose K = 3 and a plane request landing time 56. If there are landing requested for 60 and 45 already granted, then the differences from either sides are 60-56 = 4 and 56-45 = 11. Satisfies the K = 3 constraint. Landing request will be granted. However, if landing times 58 and 45 have already been granted, then 58-56 = 2, which is less than 3. So, landing request will not be granted. In this problem, you will be implementing several functionalities of this plane landing system using BST ("Landing times BST"). Your plane landing system should first ask for the K value from the user, then implement the following functionalities. Your landing times BST should store the landing time (use as the key) and the plane flight number in the node. A) Request landing-input for this functionality is the landing time. You can consider the current time as zero. If the landing time request satisfies the K constraint, grant the landing time and insert the landing time to the landing times BST. B) Withdraw landing request-A plane can withdraw landing request. This may be due to delay and cancel flight. In this case, remove the landing request from the landing BST. C) List landing times and the flight number-display the landing times and flights in the landing times BST. Write a C or C++ program that Implements above functionality