Project 5 Submit: eLearning Instructions: • Submit .java files only. • This is an individual assignment. Answers should be your own work. Include comments where appropriate. Every java file should...

i have attached.


Project 5 Submit: eLearning Instructions: • Submit .java files only. • This is an individual assignment. Answers should be your own work. Include comments where appropriate. Every java file should have comment block with your name, course section and description about the assignment at the beginning. Chapter 25: BST The task of this project is to complete all necessary methods of BST class. Modify BST class to implement the following new methods(: - Tree height method to calculate height of BST at any given point of implements /** Returns the height of this binary tree */ public int height() - Breadth First Traversal to traverse and print nodes of the tree /** Displays the nodes in a breadth-first traversal */ public void breadthFirstTraversal() - Leaf count: Add new method to count and return the number of leaf nodes: /** Returns the number of leaf nodes */ public int getNumberOfLeaves() - Nonleaves count: add new method to count and return the number of nonleaf nodes /** Returns the number of nonleaf nodes */ public int getNumberofNonLeaves() - Inorder traversal without using recursion. Implement inorder method in BST using stack instead of recursion. /** print tree nodes in inorder traversal */ public void nonRecursiveInorder () - postorder traversal without using recursion. Implement inorder method in BST using stack instead of recursion. /** print tree nodes in inorder traversal */ public void nonRecursivepostorder () - preorder traversal without using recursion. Implement inorder method in BST using stack instead of recursion. /** print tree nodes in inorder traversal */ public void nonRecursivepreorder() Create TestBST class to all new methods and methods listed below. Test with Tree with String nodes and then Integer nodes. Insert between 10-15 tree nodes. - public boolean search(E e) - public boolean insert(E e) - public TreeNode getRoot() - public java.util.ArrayList<>> path(E e) - public boolean delete(E e) Use the BST.java , Tree.java Submit files: BST.java, Tree.java and TestBST.java T A S K L I S T You are required to complete the following activities by the deadlines specified and submit the appropriate deliverables through eLearning. ACTIVITY Create Class Files having its own main method for each of the problems in this assignment. Compile, Execute and Test your program Zip the Java Files as a single zipped file named with your lowercase NetID (example: abc123456.zip) and submit on eLearning. G U I D E L I N E S You will be graded according to the following guidelines:  You are required to submit files through eLearning by the specified deadline. You can earn a maximum of 100 points.  If the files do not compile, you will receive a 0 for the program.  You are graded primarily on the design of your class and the adequate testing of your class. Poor design or inadequate testing will result in loss of points.  Your files should be adequately commented. Up to -15 points will be deducted for poor indentation and documentation.