Program4/BinarySearchTree.cpp
int BinarySearchTree::numOfWords(BinarySearchNode *start){
	if(start != NULL){
		int num = 1;
		num+=numOfWords(start->getLeft());
		num+=numOfWords(start->getRight());
		return num;
	}
	return 0;
}
//returns the total number of unique words
returns the total number of unique words
returns the total number of unique words
int BinarySearchTree::numOfWords(BinarySearchNode *start){
	if(start != NULL){
		int num = 1;
		num+=numOfWords(start->getLeft());
		num+=numOfWords(start->getRight());
		return num;
	}
	return 0;
}
int BinarySearchTree :: numOfWords ( BinarySearchNode * start ) { if ( start != NULL ) { int num = 1 ; num += numOfWords ( start -> getLeft ( ) ) ; num += numOfWords ( start -> getRight ( ) ) ; return num ; } return 0 ; }
returns the total number of unique words
returns the total number of unique words