Binary Search Tree

You will be reading input lines that give information of items that are sold and received from vendors. The program should produce a detail report along with a summary report listing each item in stock. Input lines look like this: R 12345 15 Computer The first character is either R or S (Received or Sold) Next is the part number followed by the quantity received or sold. The last field is a description of the item. Make a class called "bintree" that will keep all this information in order of part number and can produce output with a PrintAll function. Recursion is encouraged, however not necessary. The specification for the bintree class will be given as well as another file called "main.h" that includes a struct "invrecdef". It should be written in C++ so that it is compatible with the Borland Compiler (Borland C++ Version 4.52) There should be a bintree.h file (given), a [login to view URL] file and a [login to view URL] file as well as a main.h(which includes the structure "invrecdef"). ## Deliverables A file bintree.h (given), a file [login to view URL] (the implementation file to bintree.h), a main.h which includes the given structure specification- struct invrecdef, and finally a [login to view URL] which is obviously just the actual main function. Also a listing of the output that the program produces from the given input will be needed. All files that you need will be given under "other files" ## Deadline information This must be completed by Wednesday November 21, 2001.