Question

3) (10 pts) Write a function that takes in a root node of a trie and returns the length of the longest word stored in that trie. Use the struct given and function prototype given below. typedef struct trienode { int isWord; struct trienode* next [26]; } trienode; int maxWordLength (trienode* root) { // Fill in code }

Answer 1

3)//returns max word length stored in trie
int maxWordLength(trienode* root){
   if(root==NULL)
   return 0;
   int max=0;
   for(int i=0;i<26;i++)
   {
       int k = 1+maxWordLength(root->next[i]);//calling all links through recursion
       if(max<k)
       max=k;  
   }
   return max;
}