public int findMax() { *See BST.java for method specification */ /* Your code here */ return findMax_r(); // Dummy return statement. Remove when you implement! } private int findMax_r() { //code goes...

IN JAVA LANGUAGE

FILL OUT THE FIND MAX FUNCTION

public int findMax();
/* Returns the largest element in the tree.
* This method should call upon the recursive findMax_r() you write.
*
* @return the largest element in the tree (an int value)
* Example: findMax() will return 29 for the tree below
*
* (28)
* / \
* (14) (29)
* /
* (1)
*/

DO THIS BY CALLING A RECURSIVE FUNCTION

SHOULD RETURN LARGEST ELEMENT IN A BST

THANK YOU!!!!!

Extracted text: public int findMax() { *See BST.java for method specification */ /* Your code here */ return findMax_r(); // Dummy return statement. Remove when you implement! } private int findMax_r() { //code goes here


Extracted text: public class BSTIMP1 implements BST { private Node root; private int size; public BSTImpl() { root = null; size = 0; public BSTImpl(int val) { this.root - new NodeImpl(val); size = 1;