Solution Review: Suffix Score

#include <iostream>
#include <vector>
using namespace std;

// Definition of a trie node
class TrieNode
{
    public:
       	// pointer to the next 26 alphabets
        TrieNode *children[26] = {};

       	// in integer to store the number of times 
       	// suffix is visited
        int cnt = 0;
};

class Trie
{
    public:
        TrieNode * root;
        Trie()
        {
            root = new TrieNode();
        }
    
       	// inserts the word in reverse order in trie
        void insert(string word)
        {
           	// point current node to the root
            TrieNode *curr = root;
           	// traverse the word in reverse order
            for (int i = word.size() - 1; i >= 0; i--)
            {
                int index = word[i] - 'a';
    
               	//create a new node if not already existing
                if (!curr->children[index])
                {
                    curr->children[index] = new TrieNode();
                }
    
               	// increment the count
               	// associated with the suffix 
                curr->children[index]->cnt++;
                curr = curr->children[index];
            }
        }
    
        int findSuffixScoreSum(string word)
        {
           	// point current node to the root
            TrieNode *curr = root;
            int scoreSum = 0;
           	// traverse the word in reverse order
            for (int i = word.size() - 1; i >= 0; i--)
            {
                int index = word[i] - 'a';
               	// add the count associated with each suffix
                scoreSum += curr->children[index]->cnt;
                curr = curr->children[index];
            }
    
            return scoreSum;
        }
};

vector<int> suffixScores(vector<string> words)
{
    int n = words.size();
    Trie *trie = new Trie();
   	// Insert words in trie
    for (int i = 0; i < n; i++)
    {
        trie->insert(words[i]);
    }

    vector<int> answer(n, 0);
    for (int i = 0; i < n; i++)
    {
       	// Get the score of all suffixes of given string
        answer[i] = trie->findSuffixScoreSum(words[i]);
    }

    return answer;
}