0
我正在关注一本书,解决问题& C中的程序设计,以学习C.在本书中,他们给出了构建二叉搜索树的所有必要部分.... 但是,我的实施没有奏效。这里是插入部分;二进制搜索树插入不起作用
void
add_to_t(tree_node_t *oldTreep, // input/output - binary search tree
tree_element_t ele) // input - element to add
{
oldTreep = tree_insert(oldTreep, ele);
}
tree_node_t * tree_insert(tree_node_t *oldTreep, tree_element_t ele)
{
if(oldTreep == NULL){
oldTreep = TYPED_ALLOC(tree_node_t);
strcpy(oldTreep->element.name, ele.name);
strcpy(oldTreep->element.sName, ele.sName);
oldTreep->element.seatClass = ele.seatClass;
oldTreep->leftp = NULL;
oldTreep->rightp = NULL;
}
else if (strcmp(oldTreep->element.name, ele.name)==0){
/* duplicate key - no insertion */
}
else if (strcmp(oldTreep->element.name, ele.name)>0){
oldTreep->rightp = tree_insert(oldTreep->rightp, ele);
}
else
{
oldTreep->leftp = tree_insert(oldTreep->leftp, ele);
}
return(oldTreep);
}
我的scan_passenger函数(我从这个函数调用的结果中传递ele);
void scan_passenger(tree_element_t *pass)
{
char passName[10], passSname[10];
int classNum;
printf("\nEnter the Name of passenger to add the binary search tree> ");
scanf("%s", passName);
printf("Enter the Surname of passenger to add the binary search tree> ");
scanf("%s", passSname);
printf("Enter the class number of passenger to add the binary search tree> ");
scanf("%d", &classNum);
strcpy(pass->name, passName);
strcpy(pass->sName, passSname);
pass->seatClass = classNum;
}
而我的typdefs和标头如果需要;
#include "stdio.h"
#include "stdlib.h"
#include "string.h"
#define TYPED_ALLOC(type) (type *)malloc(sizeof (type))
typedef struct tree_element_s {
char name[10];
char sName[10];
int seatClass;
}tree_element_t;
typedef struct tree_node_s {
tree_element_t element;
struct tree_node_s *leftp, *rightp;
}tree_node_t;
我的问题是它没有创建二叉搜索树的根。当我尝试向堆中添加新元素时,它似乎创建了一个新节点。当我追踪我的代码时,似乎这个函数的每个实例都返回NULL。每次当我调用tree_insert时,我都会说,如果语句(认为根是NULL),它会先执行... 对不起,我的英文不好。在谈论编码术语时,我可能会犯一些错误(这可能是因为,我从1年后没有回到学习C的书籍,所以我可以混合它们) 在此先感谢。