자료구조 코드 좀 봐주실 수 있을까요?

Question

#include #include #pragma warning(disable: 4996)typedef struct node {int level;int key;int child_key;struct node* left;struct node* right;} Node;Node* root = NULL;// function to create a new nodeNode* newNode(int level, int key, int child_key) {Node node = (Node)malloc(sizeof(Node));node->level = level;node->key = key;node->child_key = child_key;node->left = NULL;node->right = NULL;return node;}// read the general tree inputvoid input(Node* node, int level, int key, int child_key) {if (node->level == level) {if (node->right == NULL) {node->right = newNode(level, key, child_key);return;}elseinput(node->right, level, key, child_key);}else {if (node->child_key == key) {node->left = newNode(level, key, child_key);return;}else {if (root->left == NULL)input(node->right, level, key, child_key);elseinput(node->left, level, key, child_key);}}}// function to traverse a binary tree in preorder and print the keys of the nodes visitedvoid traversePreorder(Node* root) {if (root != NULL) {printf("%d ", root->key);traversePreorder(root->left);traversePreorder(root->right);}}int main() {int level, key, child_key;char child[5];while (1) {printf("Please input data following format ");printf("(if you want to stop, input = 0 0 0) ");printf("(tree-level, key, child_key) -> 1 100 75 : ");scanf("%d %d %s", &level, &key, child);if (level == 0)break;if (child == "NULL ")child_key = 0;elsechild_key = atoi(child);if (level == 1) {root = newNode(level, key, child_key);}elseinput(root, level, key, child_key);printf(" ");}printf("[Preorder traversal result] ");traversePreorder(root);return 0;}이렇게 구현했고 (1 100 200) (2 200 NULL) (2 75 25) (2 300 NULL)(3 25 NULL) (3 50 NULL) (3 30 120) (3 150 NULL)(4 120 NULL) (4 55 NULL) 이 순서대로 넣어서 결과를 출력해야 하는데(3 25 NULL)을 입력하면 프로그램이 그냥 종료되어버립니다. 혹시 왜그런지 알 수 있을까요?일반적인 tree에서 바이너리 tree로 바꾼다음에 출력하는 프로그램입니다.

kenu,전독시 · Answer

from: https://ai.com

자료구조 코드 좀 봐주실 수 있을까요?

1개의 답변

기타 목록