Program4/BinarySearchTree.cpp
void BinarySearchTree::printTree(BinarySearchNode *start){
	if(start != NULL){
		printTree(start->getLeft());
		start->printNode();
		printTree(start->getRight());
	}
}
//Recurses through each node and prints the nodes in alphabetical order.
Recurses through each node and prints the nodes in alphabetical order.
Recurses through each node and prints the nodes in alphabetical order .
void BinarySearchTree::printTree(BinarySearchNode *start){
	if(start != NULL){
		printTree(start->getLeft());
		start->printNode();
		printTree(start->getRight());
	}
}
void BinarySearchTree :: printTree ( BinarySearchNode * start ) { if ( start != NULL ) { printTree ( start -> getLeft ( ) ) ; start -> printNode ( ) ; printTree ( start -> getRight ( ) ) ; } }
Recurses through each node and prints the nodes in alphabetical order.
Recurses through each node and prints the nodes in alphabetical order .