Project 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