HI! I need help writing a function that find the most frequent word thath has been inserted into a Trie. I have a count field that lets me know if I am at the terminal node of of the string. If the same string is inserted again the counter variable is incremented. So I need to traverse the Trie and find what is the most frequent word in the Trie. If any of the strings have been inserted the same amount of times I want to return the string that comes in first alphabetical order. I am just having trouble on how to go about traversing the Trie and comparing the string in alphabetical order if their count fields are equal. Below is my Trie struct, the code is in C language.

struct TrieNode

{

int count;

struct TrieNode *children[26];

} ;