Data Structures Interval Trees Implementation C/C++

Write an Implementatin of **Interval trees**( if u dont know read abt them in attached pdf **Part2** Pages 117-125). Especially you should use the top-down optimal search trees as underlying tree structure:- - ask the user to input several intervals, then - call your function to build the interval tree, then - ask the user for query numbers, and for each query it uses your queryintervaltree funcion, and lists all those intervals that contain the query number. Some Example code is implemented on Pages 48-53, Pages 30-40 and Pages 22-23 of **PArt1** Pdf File. Your program should be in standard C, C++. It should ask user for input. It should have some kind of on screen display of the tree and the current function performed. Please so not submit program that fails to compile. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables): a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform Windows C,C++