西电软工oop上机题目4 10.8.rar

#include "Tnode.hpp" // 因为下面使用了 Tnode的成员，所以必须包含。 #include "BSTree.hpp" // 必须包含类定义文件 using namespace std; int regist_word(Tnode* & root, const std::string& newWord); void print_pre_order(std::ostream& outFile, const Tnode* root, unsigned int deepth = 0); void print_middle_order(std::ostream& outFile, const Tnode* root); BSTree::BSTree() : myRoot(NULL) { } BSTree::~BSTree() { if (NULL != myRoot) delete myRoot; } bool BSTree::regist(const std::string& newWord) { if (newWord.length() == 0) return false; regist_word(myRoot, newWord); return true; } bool BSTree::regist(const char* newWord) { if (NULL == newWord || '\0' == newWord[0]) return false; regist_word(myRoot, newWord); return true; } void BSTree::print(std::ostream& outFile) { if (myRoot == NULL) { outFile << "<NULL tree>\n"; return; } print_pre_order(outFile, myRoot, 0); } void BSTree::print_byorder(std::ostream& outFile) { if (myRoot == NULL) { outFile << "<NULL tree>\n"; return; } print_middle_order(outFile, myRoot); } int regist_word(Tnode* & root, const string& newWord) { if (NULL == root) { root = new Tnode(newWord); return 0; } int r = newWord.compare(root->getWord()); if (r == 0) { // newWord 已经登记在树中，就是这个结点. root->getCount() += 1; } else if (r < 0) // 小值放到 左孩子 { regist_word(root->getLeft(), newWord); } else // 大值放到 右孩子 { regist_word(root->getRight(), newWord); } return 0; } void print_pre_order(std::ostream& outFile, const Tnode* root, unsigned int deepth) { // 缩进，以便于观察结点深度 for (unsigned int d = 0; d<deepth; ++d) outFile << " "; if (NULL == root) { outFile << "<NULL>\n"; //这个输出用于表现/区分左右孩子。 return; } root->print(outFile); if ((NULL == root->getLeft()) && (NULL == root->getRight())) return; print_pre_order(outFile, root->getLeft(), deepth + 1); print_pre_order(outFile, root->getRight(), deepth + 1); } // 按中序遍历方式，递归地输出树 void print_middle_order(std::ostream& outFile, const Tnode* root) { if (NULL == root) return; if (NULL != root->getLeft()) print_middle_order(outFile, root->getLeft()); root->print(outFile); if (NULL != root->getRight()) print_middle_order(outFile, root->getRight()); }