搜索树（retrieval）（哈希树的一种）

最新推荐文章于 2024-10-12 19:08:41 发布

暗夜逐月

最新推荐文章于 2024-10-12 19:08:41 发布

阅读量281

点赞数 4

文章标签：哈希算法 c# 算法

本文链接：https://blog.csdn.net/weixin_53004417/article/details/137079224

版权

空间换时间，针对大量数据

数据量越大，利用率越高

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define DESC_SIZE   256
#define KEY_SIZE    256
#define BUFSIZE     512
#define FNAME       "/home/wjy/Desktop/code/tree/trie/log"

struct node_st
{
    struct node_st *ch[26];
    char desc[DESC_SIZE];
};

int  get_word(FILE *fp,char *key,char *desc)
{
    char buf[BUFSIZE];
    char *retp;
    int i,j;


        retp = fgets(buf,BUFSIZE,fp);
        if (retp == NULL)
            return -1;


    for(i = 0;i < KEY_SIZE-1 && buf[i] != ':';i++)
        key[i] = buf[i];

    key[i] = '\0';

    i++;
    for(j = 0;j < DESC_SIZE-1 && buf[i] != '\0';i++,j++)
        desc[j] = buf[i];
    
    desc[j] = '\0';

    return 0;
}

struct node_st *newnode(void)
{
    int i;
    struct node_st *node;

    node = malloc(sizeof(*node));
    if(node == NULL)
        return NULL;

    node->desc[0] = '\0';
    for(i = 0;i < 26;i++)
        node->ch[i] = NULL;

    return node;
}

int insert(struct node_st **root,char *key,char *desc)
{
    if(*root == NULL)
    {
        *root = newnode();
        if(*root == NULL)
            return -1;
    }

    if(*key == '\0')
    {
        strcpy((*root)->desc,desc);
        return 0;
    }

    return insert((*root)->ch+*key-'a',key+1,desc);

}

char *find(struct node_st *root,char *key)
{
    if(root == NULL)
        return NULL;
    
    if(*key == '\0')
        return root->desc;
    return find(root->ch[*key-'a'],key+1);
}

int main()
{
    FILE *fp;
    char desc[DESC_SIZE] = {'\0'},key[KEY_SIZE] = {'\0'};
    char *datap;
    int ret;
    struct node_st *tree = NULL;

    fp = fopen(FNAME,"r");
    if(fp == NULL)
    {
        fprintf(stderr,"fopen():error!\n");
        exit(1);
    }

    while(1)
    {
        ret = get_word(fp,key,desc);
        if(ret == -1)
            break;

        insert(&tree,key,desc);
        // puts(key);
        // puts(desc);
    }

    datap = find(tree,"donkey");
    if(datap ==NULL)
        printf("can not find!\n");
    else
        puts(datap);    
    fclose(fp);
    exit(0);
}