在这个代码的基础上，简单改了一下

#include <bits/stdc++.h>
using namespace std;

struct node {
    int num;
    node* next[26];
};

void init(node* m) {
    for (int i = 0; i < 26; i++) {
        m->next[i] = NULL;
    }
}

void insert(node* root, string a) {
    node* current = root;
    for (char c : a) {
        int idx = c - 'a';
        if (current->next[idx] == NULL) {
            node* temp = new node();
            temp->num = 1;
            init(temp);
            current->next[idx] = temp;
        } else {
            current->next[idx]->num++;
        }
        current = current->next[idx];
    }
}

bool is_leaf(node* m) {
    for (int i = 0; i < 26; i++) {
        if (m->next[i] != NULL) {
            return false;
        }
    }
    return true;
}

int leaf(node* m) {
    if (m == NULL) {
        return 0;
    } else if (is_leaf(m)) {
        return 1;
    } else {
        int ans = 0;
        for (int i = 0; i < 26; i++) {
            ans += leaf(m->next[i]);
        }
        return ans;
    }
}

int main() {
    int n;
    while (cin >> n && n != 0) {
        node* root = new node();
        init(root);
        for (int i = 0; i < n; i++) {
            string a;
            cin >> a;
            insert(root, a);
        }
        cout << leaf(root) << endl;
    }
    return 0;
}