BinTree JAVA

I inserted a photo since the text is missing the tree required for the assignment. I need this completed by 6pm est. 9/11/15, Thank you! Implement a generic binary tree class using an internal node class to store the elements. (BinTreeUMUC and NodeBinTree). Specific requirements include: • Implement a driver class for the BinTreeUMUC class. There should be appropriate comments in the source code files. Exceptions should be thrown when necessary. • Define a data file format to specify a binary tree and create at least one such input file (which will be used to test your program) • Use the menu based approach you defined in Week 1 to test your stack class. Methods for BinTreeUMUC • BinTreeUMUC (Scanner) – create a tree from a Scanner tied to a file • BinTreeUMUC () – no-parameter constructor • N getRoot () • String toPreOrderString () – collects nodes in preorder • String toInOrderString () – collects nodes in inorder • String toPostOrderString () – collects nodes in postorder • String toLevelOrderString () – collects nodes level after level starting with the root • int countNodes() – counts all the nodes • int countLeafs() – counts the leafs • int countLeft() – counts the nodes that have only the left child (right child is null) • int countRight() – counts the nodes that have only the right child (left child is null) • int countNodesLevel(int) – counts nodes from a certain level given as parameter • Add other methods if needed Create a test report ([login to view URL]…) showing the correct behaviour of all the methods; include a description of the design and lessons learned; include screenshots of your running program. (the testing procedure will be provided soon) Deliverables: - input file(s) - the Java source code files - the test report files ([login to view URL]) Please create an archive (zip/rar) with all the deliverables, name it as “Project2”+yourname, and submit using LEO under the Project 2 assignment. Note: this is a general binary tree, no “order” between its nodes exists. PS: The testing procedure for your program is given below. Given the tree below: Create the input file that describes this tree using your chosen input data format (Make sure to describe in your report document – [login to view URL] – the format you use for representing a tree in an input file). Select the menu option for loading the input file and creating a tree in the main memory. Call the following functions (using your menu): • String toPreOrderString () – collects nodes in preorder • String toInOrderString () – collects nodes in inorder • String toPostOrderString () – collects nodes in postorder • String toLevelOrderString () – collects nodes level after level starting with the root • int countNodes() – counts all the nodes • int countLeafs() – counts the leafs • int countLeft() – counts the nodes that have only the left child (right child is null) • int countRight() – counts the nodes that have only the right child (left child is null) • int countNodesLevel(int) – counts nodes from a certain level given as parameter and record the results in your report document ([login to view URL]) using screenshots from your Project.