Binary / heap

A) Instantiate the binary search tree for integer values, using the input list 20 29 11 6 35 4 52. Then output these values after which two new integer values are input into the tree: 7, 24. Then display the values in this version of the tree. Finally remove the values 6 and 24 from the current tree and display the contents of teh final tree. B) Do the same as (2) above, now using character values from the input list 'n' 'c' 'k' 'r' 'o' 'a' 't' 'h'. Display the current contents of the tree ] and then insert two additional values. 'z' 'j' and then display the contents of the revised tree. Finally remove the value 'h' from this last version and display the contents of teh revised code once again. C) Write teh formal code for heapsort and apply the coded implementation of the algorithm to sort each og the following sequence of values. Int vals--> 23, 36 89 12 134 61 66 Cahrs --> r o s a l i e After execution of each sorting step display the array, indicating the sorted part and the semi -heap ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site). ## Platform Windows 2000