我正在存储城市列表(从文件中读取)及其相应的纬度和经度值。在每个城市的末尾,我试图附加经度和纬度值。
因此,例如,特里的弗里蒙特看起来像
F->R->E->M->O->N->T->(经纬度)
我能够成功地将值插入到 trie 中,但是当我尝试搜索特定城市时,经度和纬度值返回为 (null)
这是我的实现
void readFile(){
//the functions that deal with the trie
struct trieNode *node = initializeTrie();
trieInsert(node, place, longitude, latitude);
getTrie(node, place);
trieFree(node);
}
struct trieNode{
char *longi;
char *lat;
struct trieNode *children[27];
char value;
};
struct trieNode *initializeTrie(){
struct trieNode *pNode = NULL;
pNode = (struct trieNode *)malloc(sizeof(struct trieNode));
if(pNode){
pNode->longi = '\0';
pNode->lat = '\0';
pNode->value = '\0';
memset(pNode->children, 0, sizeof(pNode->children));
}
return pNode;
}
void trieFree(struct trieNode *root){
int i;
if(root){
for(i = 0; i<= 26; i++){
trieFree(root->children[i]);
}
}
free(root);
}
int trieInsert(struct trieNode *node, char *key, char *longitude, char *latitude){
struct trieNode *parent = node;
//printf("Longi: %s", longitude);
//printf(" ");
//printf("Latitude: %s \n", latitude);
if(key){
int index = 0;
int i = 0;
if(node){
while(key[i] != '\0'){
int indexVal = convertLetterToIndex(key[i]);
if(!parent->children[indexVal]){
parent->children[indexVal] = initializeTrie();
parent->children[indexVal]->value = key[i];
}
parent = parent->children[indexVal];
i++;
}
int longitudeLen = strlen(longitude);
int latitudeLen = strlen(latitude);
node->longi = malloc(longitudeLen + 1);
strncpy(node->longi, longitude, longitudeLen + 1);
node->longi[longitudeLen] = '\0';
//printf("Longi: %s", node->longi);
node->lat = malloc(latitudeLen + 1);
strncpy(node->lat, latitude, latitudeLen + 1);
node->lat[latitudeLen] = '\0';
//printf("Lati: %s \n", node->lat);
//free(node->longi);
//free(node->lat);
}
}
}
//function to print the long and lat values based on the city
void getTrie(struct trieNode *root, char *key){
struct trieNode *pNode = root;
//bool flag = false;
if(!key){
printf("Not found \n");
}
if(!root){
printf("Not found \n");
}
int i = 0;
while(key[i] != '\0'){
int indexVal = convertLetterToIndex(key[i]);
if(!pNode->children[indexVal]){
printf("Not found \n");
}
pNode = pNode->children[indexVal];
i++;
}
printf("Longitude: %s", pNode->longi);
printf(" ");
printf("Latitude: %s \n", pNode->lat);
}