I need help with an assignment regarding Binary Search Trees Here is the assignment Closest Value in a Binary Search Tree (BST) Without using an iterator, create a new method called closestValue()that takes an Object value and then locates a value in the tree that is closest to this Object If the root of the tree is NULL, your method should throw an InvalidTreeArgument exception The prototype for this method should be the following object BST closestValue (Object value) For example, suppose you have the following BST 32 24 41 21 28 36 47 14 25 31 39 closestValue( 10 ) should return 14 closestValue (20) should return 21 closestValue( 42 ) should return 41 HINT The answer returned will come from the nodes found on the path followed as if the Object parameter is getting inserted into the tree HINT Use recursion and pass additional parameters that keep track of the closest value you have seen so far Pass this closest value by reference so that future recursive calls can update this parameter as additional nodes are encountered Create a test driver program that exercises each of these methods, prints the tree and the results of each operation

The Answer is in the image, click to view ...

Answered step by step

Verified Expert Solution

Link Copied!

Question

1 Approved Answer

Posted on Sep 24, 2024

I need help with an assignment regarding Binary Search Trees. Here is the assignment: Closest Value in a Binary Search Tree (BST) Without using an

I need help with an assignment regarding Binary Search Trees. Here is the assignment: image text in transcribed

Closest Value in a Binary Search Tree (BST) Without using an iterator, create a new method called closestValue()that takes an Object value and then locates a value in the tree that is closest to this Object. If the root of the tree is NULL, your method should throw an InvalidTreeArgument exception. The prototype for this method should be the following: object BST