This is a job scheduling problem solved with minimum complexity. A new city is being constructed and a program is required to keep track of all the buildings that have been built. A building record has 3 fields: Building number, Executed time and Total time. The Min Heap is used to store the buildings based on Executed Time and the RBT stores it based on the Building Number. The building with the least Executed time is chosen to be worked on, it is worked on for either 5 days or till it has completed construction. After completion, it is removed from the data structure. The buildings are printed using the RBT.
