수다닷컴

질문 제목 : 이진탐색트리 중위순회인데 실행이 안되네요 ㅠ어떻게 고쳐야 되죠? 급합니다 ㅠㅠ질문 내용 :
#include stdio.h
typedef struct node *tree_pointer;
typedef struct node {
tree_pointer left_child;
int data;
tree_pointer right_child;
} tree;

void insert_node(tree_pointer *, int);
tree_pointer modified_search(tree_pointer, int);
void inorder(tree_pointer);
int main() {
tree_pointer tree=null;
int i, num[10]={5,2,6,8,4,9,1,0,7,3};
for (i=0; i10; i++)
insert_node(&tree, num[i]);
inorder(tree);
}
void insert_node(tree_pointer *node, int num) {
tree_pointer ptr, temp = modified_search(*node, num);
if (temp || !(*node)) {
ptr = (tree_pointer) malloc(sizeof(struct node));
ptr-data = num;
ptr-left_child = ptr-right_child = null;
if (*node)
if (numtemp-data) temp-left_child = ptr;
else temp-right_child = ptr;
else *node = ptr;
}
}
tree_pointer modified_search(tree_pointer tree, int key) {
tree_pointer temp;
if (!tree) return null;
while (tree) {
temp=tree;
if (key==tree-data) {
printf(duplicate key: %d\n, key);
exit(1);
}
if (keytree-data) tree = tree-left_child;
else
tree = tree-right_child;
}
return temp;
}
void inorder(tree_pointer ptr) {
if (ptr) {
inorder(ptr-left_child);
printf(%d, ptr-data);
inorder(ptr-right_child);
}
}

신청하기