In the BST class, add a non-static method min which takes no parameters and returns the String that is the minimum data stored in the tree. You can add helper methods if you would like, but you are not required to do so.

public class BST{

Node root;

public BST(){ }

public void add( String data ){

Node n = new Node( data );

if( root == null ){

root = n;

return;

}

Node curr = root;

boolean added = false;

while( !added ){

int c = curr.data.compareTo( data );

if( c > 0 ){

if( curr.left == null ){

curr.left = n;

added = true;

n.parent = curr;

}

else{

curr = curr.left;

}

}

else{

if( curr.right == null ){

curr.right = n;

added = true;

n.parent = curr;

}

else{

curr = curr.right;

}

}

}

}

public class Node{

String data;

Node left;

Node right;

Node parent;

public Node( String data ){

this.data = data;

}

}

// YOUR CODE HERE

}