[Solved]Given Binary Search Tree Adt Implementation Extend Implementation Adding Five Operations L Q37077729
Given a binary search tree ADT implementation, extend theimplementation by adding the five operations listed below. Note:your method declarations must exactly match the declarationsshown.
public BSTNode<T> getRoot()
Return a reference to the root of the tree.
public T getMax()
Return the largest element in the tree. If the tree is empty,return null.
public int leafCount()
Return the number of leaf nodes in the tree.
public int onlyChildCount()
Return the number nodes in the tree that have exactly one childnode.
public boolean similarTree(BinarySearchTree other)
Given a reference to another tree as a parameter, return true ifthe two trees have the same shape, otherwise return false. That is,return true if the tree object used to call this method has thesame shape as the tree passed as the parameter to the method.
Additional requirements regarding how a given operation isimplemented may be specified.
Part 2
The LeaderBoard app is used to maintain and report out theresults of a golf tournament. The name of each participant andtheir score is entered using a CLI, and then the following resultsare to be displayed:
- The complete list of golfers and their scores, listed in orderof lowest to greatest score
- The average score
- The number of golfers that scored less than or equal to athreshold or ‘cut’ score that is entered by the user
Given an incomplete LeaderBoard app, develop the additionallogic in order to produce the outputs identified in the bulletpoints noted immediately above.
A complete submission package will include all of the followingitems:
>>Source code – all source code in a singlezipped Eclipse project*>>Overall description of the project>>Test Plan – limit your test plan to thenew BST operations
*in lieu of an entire Eclipse project file, you may submityour BinarySearchTree.java and LeaderBoard.java
note that Canvas allows for submitting multiples at one time;please, no .rar files – thanks
PP#5 Grading Standard
ProgProjFive.zip
PreviousNext
Expert Answer
Answer to Given a binary search tree ADT implementation, extend the implementation by adding the five operations listed below. Not… . . .
OR
