Program4/BinarySearchTree.cpp
void BinarySearchTree::printTree(){
	//after text file is done being parsed, set up header for the table of words
	cout << left << setw(25) << setfill(' ') << "Word" << "|" << left << setw(5) << setfill(' ') << "Count" << "|" << "Lines" << endl;
	printTree(startPointer);
	//Once it is printed, we print out the total unique words. 
	cout << left << setw(25) << setfill(' ') << "Total Unique Words" << "|";
	cout << (numOfWords(startPointer)-1) << endl;
}
//Prints the tree, by passing along the starting pointer.
Prints the tree, by passing along the starting pointer.
Prints the tree by passing along the starting pointer .
void BinarySearchTree::printTree(){
	cout << left << setw(25) << setfill(' ') << "Word" << "|" << left << setw(5) << setfill(' ') << "Count" << "|" << "Lines" << endl;
	printTree(startPointer);
	cout << left << setw(25) << setfill(' ') << "Total Unique Words" << "|";
	cout << (numOfWords(startPointer)-1) << endl;
}
void BinarySearchTree :: printTree ( ) { cout << left << setw ( 25 ) << setfill ( ' ' ) << " " << " " << left << setw ( 5 ) << setfill ( ' ' ) << " " << " " << " " << endl ; printTree ( startPointer ) ; cout << left << setw ( 25 ) << setfill ( ' ' ) << " " << " " ; cout << ( numOfWords ( startPointer ) - 1 ) << endl ; }
Prints the tree, by passing along the starting pointer.
Prints the tree by passing along the starting pointer .
//after text file is done being parsed, set up header for the table of words //Once it is printed, we print out the total unique words. 