Binary Tree

**1.** For this project, you must supply the code for six of the functions present in the attached file bin-trees-A.cc. The file contains the implementation of a binary tree structure and of some functions to manipulate it. Moreover, the file contains some functions to test this structure and the manipulation functions. To compile this program you should use the command: g++ [login to view URL] -o btree This will create an executable named "btree" (you can change this name if you want) which can be run with the command btree. **2.** To feed data to this program without having to type it every time, you can use the Unix-Linux redirection option "<". For example, we'd like to run the program by taking the input from the attached file: [login to view URL] For this, download the file into the same directory as your program and run the program again with the following command: btree < [login to view URL] This should create a tree that looks like the attached file tree.gif. Modify [login to view URL] to test the functions that you have implemented after it builds the tree. Thus, after printing the tree, it should * count and print the number of zero data values in the tree, * then determine its height, * then increment all the values by one and print the tree again, * then replace the tree with its mirror image and print it, * then destroy the tree and then quit. ## Deliverables 1) Complete and fully-functional working program(s) in ready to compile (linux) form as well as complete source code of all work done. 2) 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 Linux