BinTree C++

Binary Tree based program *Need completion ASAP Program is to have the following menu: 1. Fill tree from file [login to view URL] 2. Insert a node into the tree 3. Print KEYS ONLY in ascending order 4. Print KEYS with GPAs in preorder 5. Print KEYS with GPAs in postorder 6. Print KEYS with GPAs in descending order 7. Count nodes in tree 8. Calculate for a KEY in the tree 9. Search for a KEY in the tree 10. Delete a node from the tree 11. Quit Enter Choice: Notes: 1. choice #1 (fill_tree) will call function insert to insert data into tree 2. choice #8 (calculate gpa) : rounding the gpa is unnecessary 3. choice #10 (delete node) : deleted node with two children, the deleted node will be replaced with the node containing the lowest key value in the right node subtree of the node to be deleted 4. *combine [login to view URL] and bintree.h files in bintree.h and then "#include bintree.h: in [login to view URL] 5. use pre/post conditions to document functions and const reference parameters when appropriate 6. Add a public destructor function "~Binary_tree();" to deallocate all nodes in the tree Feel free to change old code.