public String searchTree (Node n, String searchVal) { if (n.isEmpty())//no more children { return null; } else if (n.root().toString().equals(searchVal) //we found it { return n.root(); } else if (searchVal < n.root().toString()) //search left child { return searchTree(n.leftChild(),searchVal); } else //search right child { return searchTree(n.rightChild(),searchVal); } }