Question

Write a client method that returns a count of the number of nodes in a binary search tree that contain scores less than or equal to a passed-in argument (parameter) value. The method header is:

int countLowerScores (BinarySearchTree tree, int maxValue)

The BinarySearchTree contains these methods in the picture.

public class BinarySearchTreecT> implements BSTInterfacecT> //reference to the root of this BST public BSTNode<T> root; public Comparator<T> comp: IIused for all comparisons public boolean found: / used by remove public BinarYSearchTree() // Precondition : τ implements comparable 7Creates an empty BST object -uses the natural order of elements | { 10 lines public BinarySearchTree (Comparator<T> comp) Creates an empty BST object - uses Comparator comp for order of elements. |i 4 lines } public boolean contains (T target) /Returns true if this BST contains a node with info i such that // comp . compare (target, í)一0; otherwise, returns false. | { 3 lines public int size () Returns the number of elements in this BST { 3 lines } public T get (T target) // Returns info į from node of this BST where comp . compare (target, i) // if no such node exists, returns null. ...3 lines public Iterator<T iterator () 0; Inorder is the default, "natural" order. 田 |i 3 lines } public Iterator<T getIterator (BSTInterface. Traversal orderType) 7Creates and returns an Iterator providing a traversal of a "snapshot" 7 of the current tree in the order indicated by the argument. Supports Preorder, Postorder, and Inorder traversal 田 |i 38 lines }

Answer 1

ANSWER:

1) Write a client method that returns a count of the number of nodes in a binary search tree that contains a value less than or equal
to the argument value. The signature of the method is
int countLess (BinarySearchTree<Golfer> tree, Golfer maxValue)
  
int countLess (BinarySearchTree<Golfer> tree, Golfer maxValue)
{
int tree_size,i;
int number_of_nodes = 0;
tree_size = tree.reset(BinarySearchTree.INORDER);
for (i = 1; i <= tree_size; i++)
{
if ((tree.getNext(BinarySearchTree.INORDER).compareTo(maxValue))<= 0)
number_of_nodes = number_of_nodes + 1;
}
return number_of_nodes;
}