Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- TrieNode *createTrieNode(void)
- {
- int i;
- TrieNode *node = NULL;
- node = malloc(sizeof(TrieNode));
- node->count = 0;
- for (i = 0; i <26; i++)
- {
- node->children[i] = NULL;
- }
- node->subtrie = NULL;
- return node;
- }
- TrieNode *insertString(TrieNode *root, char *str)
- {
- if(*str == '\0')
- return root;
- TrieNode *temp = NULL;
- if(root->children[*str - 97] == NULL)
- {
- temp = createTrieNode();
- root->children[*str - 97] = temp;
- }
- //printf("%c\t%d\n", *str, *str - 97);
- insertString(root->children[*str - 97], str + 1);
- return root;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement