Trie树基本实现

Trie树基本实现代码。

练习使用。codepad.org已验证。

#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
#define CSIZE 256

typedef struct _Node{
    char value;
    struct _Node *children[CSIZE];
}Node;


Node *createNode(char va){
    Node * ret = (Node*)malloc(sizeof(Node));
    ret->value = va;
    memset(ret->children, 0, sizeof(void*)*CSIZE);
        return ret;
}


int insert(Node* root, const char* str){
    if(root == NULL || str == NULL)
        return -1;
    if(!*str)
        return 1;
    if(root->children[*str] == NULL){
        Node* tmp = createNode(*str);
        root->children[*str] = tmp;
        printf("appen %c to %c\n", *str, root->value);
    }
    return insert(root->children[*str],str+1);
}
int search(Node* root, const char*str){
    if(root == NULL || str == NULL)
        return -1;
    if(!*str) return 1;
    if(root->children[*str] != NULL)
        return search(root->children[*str],str+1);
    return 0;
}
int main(){
    Node* head = createNode((char)-1);
    insert(head,"ab");
    insert(head,"ac");
    insert(head,"ad");
    insert(head,"abc");

    char* tar = "abc";
    if(search(head, tar))
        printf("found %s \n", tar);
    else
        printf("cannot find %s \n", tar);
}