Question

Please help me with FLOWCHART and UML diagram for class, thank you!

#include <iostream>
#include <fstream>
#define MAX 10

using namespace std;

class WordListTree {
public:
   // Structure of a node
   struct Node {
       string key;
       // Create an array of up to MAX children
       Node* child[MAX];
   };

   // Create a tree of strings
   Node* newNode(string key) {
       Node* temp = new Node;
       (*temp).key = key;
       for (int i = 0; i < MAX; i++)
           (*temp).child[i] = NULL;
       return temp;
   }

   // Traverse the tree and search for a matching string
   void traverse(Node* root, string iData)   {
       if (root) {
           // Check for match against WordList.txt input array element
           if ((*root).key == iData) {
               cout << (*root).key << " ";
               return;
           }
           for (int i = 0; i < MAX; i++) {
               traverse((*root).child[i], iData);
           }
       }
   }

   // A function to create a tree with our internal word list
   Node* teamWordList() {
       Node* root = newNode("ANT");
           (*root).child[0] = newNode("BEE");
           (*root).child[1] = newNode("CAT");
           (*root).child[2] = newNode("DOG");
           (*root).child[3] = newNode("EMU");
           (*root).child[0]->child[0] = newNode("FOX");
           (*root).child[0]->child[1] = newNode("GOAT");
           (*root).child[1]->child[0] = newNode("HORSE");
           (*root).child[2]->child[0] = newNode("IMPALA");
           (*root).child[2]->child[0]->child[0] = newNode("JACKAL");
           return root;
   }
};

int main() {
   //Create an object of WordListTree class
   WordListTree treeObject;

   // Create the example tree int he class to use as comparison
   WordListTree::Node* root = treeObject.teamWordList();

   // Create an object of the fstream class
   ifstream iFile;
   iFile.open("WordList.txt");

   // Validate file
   if (iFile.fail()) {
       cerr << "Error Opening File" << endl;
       exit(1);
   }

   // Initialize array
   string wordList[10];

   // Vars
   string iData;

   // Read file list until EOF, extract words, enter words into array elements
   cout << "The following word(s) match:\n\n";
   for (int i = 0; i < 10; i++) {
   iFile >> iData;
       wordList[i] = iData;
       // Send element to traversal function to test for word match
       treeObject.traverse(root, iData);
   }
}

Answer 1

Flow chart for the above c++ code is :

UML diagram