/****************************************************************
* Author: Isai Damier
* Title: Visit
* Project: geekviewpoint
* Package: algorithms
*
* Time Complexity of Solution:
* Best = Average = Worst = constant.
*
* Description: This function can be anything the programmer
* needs it to be. Here it simply prints the data of a node.
*
***************************************************************/
private void visit(Node n) {
System.out.println(n.data);
}
/****
* BST visit is customarily a private method, and so normally does
* not need to be tested. And because it is really is stub in our
* case, there is nothing to test.
*/
