#include #include using namespace std; struct Node { string word; Node *left, *right; }; class tree { private: Node *root; public: tree(string arr[], int size) { root = insertLevelOrder(arr, root, 0, size); } tree(vector &vec) { string *arr = vec.data(); int size = vec.size(); root = insertLevelOrder(arr, root, 0, size); } void 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); } ~tree() { DestroyRecursive(root); } private: Node *newNode(string s) { Node *node = new Node; node->word = s; node->left = node->right = NULL; return (node); } Node *insertLevelOrder(string arr[], Node *node, int index, int n) { if (index < n) { Node *temp = newNode(arr[index]); node = temp; node->left = insertLevelOrder(arr, node->left, 2 * index + 1, n); node->right = insertLevelOrder(arr, node->right, 2 * index + 2, n); } return node; } void preOrder(Node *node) { if (node != NULL) { cout << node->word << "\n"; preOrder(node->left); preOrder(node->right); } } void postOrder(Node *node) { if (node != NULL) { postOrder(node->left); postOrder(node->right); cout << node->word << "\n"; } } void inOrder(Node *node) { if (node != NULL) { inOrder(node->left); cout << node->word << "\n"; inOrder(node->right); } } void leaf(Node *node) { if (node != NULL) { if (node->left == NULL && node->right == NULL) { cout << node->word << "\n"; } leaf(node->left); leaf(node->right); } } void DestroyRecursive(Node *node) { if (node != NULL) { DestroyRecursive(node->left); DestroyRecursive(node->right); delete node; } } }; 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!"; }

programmingAssignment2