Solution Review: Folder Count

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

// Definition of a trienode
class TrieNode
{
    public:
       	// map which stores the pointers from 
       	// folder names to the children nodes
        unordered_map<string, TrieNode*> children;
};

class FileSystem
{
    public:
        TrieNode * root;
        FileSystem()
        {
            root = new TrieNode();
        }
    
       	// inserts the directory path in the file system
        bool directoryInsert(string directory)
        {
            int insertions = 0;
           	// point the current node to the root of the trie
            TrieNode *curr = root;
    
           	// Iterate over the folder names
            for (string singleFolder: pathToStringList(directory))
            {
               	// If the folder name is not found in trie
               	// create a new one
               	// else traverse down the path
                if (curr->children.find(singleFolder) == curr->children.end())
                {
                    TrieNode *childDirectory = new TrieNode();
                    curr->children[singleFolder] = childDirectory;
                    insertions++;
                }
    
                curr = curr->children[singleFolder];
            }
    
            return insertions > 0;
        }
    
        int directoryMatchCount(string directory)
        {
           	// intialize match count as zero
            int matchCount = 0;
           	// point the current node to the root of the trie
            TrieNode *curr = root;
    
           	// Iterate over the folder names
            for (string singleFolder: pathToStringList(directory))
            {
               	// If the folder name is not found in trie
               	// it means directory does not exists
               	// return matchCount
                if (curr->children.find(singleFolder) == curr->children.end())
                {
                    return matchCount;
                }
    
                curr = curr->children[singleFolder];
                matchCount++;
            }
    
           	// if all folders in directory path are 
           	// found return matchCount
            return matchCount;
        }
    
       	// converts a directory path to 
       	// list of folder names
       	// ex : (/home/mike/profile =>["home", "mike", "profile"])
        vector<string> pathToStringList(string path)
        {
            path = path.substr(1);
            vector<string> folders;
            string folderName = "";
            for (auto p: path)
            {
                if (p == '/')
                {
                    folders.push_back(folderName);
                    folderName = "";
                }
                else
                    folderName += p;
            }
    
            folders.push_back(folderName);
            return folders;
        }
};