#include #include using namespace std; struct Node { string word; Node *left, *right, *father; }; class tree { private: Node *root; vector treeVector; public: tree(const vector &v) : treeVector(v) { root = insertTree(root, 0); } Node *newNode(string s); Node *insertTree(Node *node, int index); void preOrder(Node *node); void postOrder(Node *node); void inOrder(Node *node); void leaf(Node *node); void print(int mode); }; Node *tree::newNode(string s) { Node *node = new Node; node->word = s; node->left = node->right = NULL; return node; } Node *tree::insertTree(Node *node, int index) { if (index < treeVector.size()) { node = newNode(treeVector[index]); node->left = insertTree(node->left, 2 * index + 1); node->right = insertTree(node->right, 2 * index + 2); } return node; } void tree::preOrder(Node *node) { if (node != NULL) { cout << node->word << "\n"; preOrder(node->left); preOrder(node->right); } } void tree::postOrder(Node *node) { if (node != NULL) { postOrder(node->left); postOrder(node->right); cout << node->word << "\n"; } } void tree::inOrder(Node *node) { if (node != NULL) { inOrder(node->left); cout << node->word << "\n"; inOrder(node->right); } } void tree::leaf(Node *node) { if (node != NULL) { if (node->left == NULL && node->right == NULL) cout << node->word << "\n"; leaf(node->left); leaf(node->right); } } void tree::print(int mode) { if (mode == 1) preOrder(root); else if (mode == 2) postOrder(root); else if (mode == 3) inOrder(root); else if (mode == 4) leaf(root); } int main() { vector strVector; while (true) { string s; cin >> s; if (s == "end") break; strVector.push_back(s); } int mode; if (cin >> mode) { tree tr(strVector); while (true) { if (mode == -1) break; cout << "*****" << endl; tr.print(mode); cin >> mode; } } cout << "Done!"; }

pa2-05-04-2019