我正在用 C 語言實作中序遍歷演算法，下面是我的代碼。我的任務是將每個節點的資料添加到 nodeDataList 中。然而，nodeDataList 正在存盤奇怪的資料，
void inorder(Node* N, int* nodeDataList, int index){
if(N != NULL){
inorder(N->left, nodeDataList, index);
printf("%d: %d ", index, N->data);
nodeDataList[index ] = N->data;
inorder(N->right, nodeDataList, index);
}
}
下面是主函式中的設定，
struct Node root = {27, NULL, NULL};
struct Node root_left = {26, NULL, NULL};
struct Node root_right = {39, NULL, NULL};
struct Node root_right_right = {48, NULL, NULL};
struct Node root_right_left = {40, NULL, NULL};
struct Node *N;
struct Node *N_left;
struct Node *N_right;
struct Node *N_right_right;
struct Node *N_right_left;
N = &root;
N_left = &root_left;
N_right = &root_right;
N_right_right = &root_right_right;
N_right_left = &root_right_left;
N_right->right = N_right_right;
N_right->left = N_right_left;
N->left = N_left;
N->right = N_right;
int result = 5;
int nodeDataList[result];
int index = 0;
inorder(N, nodeDataList, index);
printf("\n");
printf("%d\n", nodeDataList[0]);
printf("%d\n", nodeDataList[1]);
printf("%d\n", nodeDataList[2]);
printf("%d\n", nodeDataList[3]);
printf("%d\n", nodeDataList[4]);
運行代碼時，我得到以下資料，
0: 26 0: 27 1: 40 1: 39 2: 48
27
39
48
-1427448988
-1086203488
我不確定 -1427448988 和 -1086203488 是什么。我已經正確創建了中序，但是 int 陣列在索引 3 和 4 處生成了不正確的資料。
uj5u.com熱心網友回復：
您在傳遞最后一個引數時遇到問題index。按值傳遞它不會在后續呼叫之間保留其值。
試試這個：
#include <stdio.h>
struct Node
{
int data;
struct Node *left;
struct Node *right;
};
typedef struct Node Node;
void inorder(Node* N, int* nodeDataList, int *index){
if(N != NULL){
inorder(N->left, nodeDataList, index);
printf("%d: %d ", *index, N->data);
nodeDataList[(*index) ] = N->data;
inorder(N->right, nodeDataList, index);
}
}
int main(void){
struct Node root = {27, NULL, NULL};
struct Node root_left = {26, NULL, NULL};
struct Node root_right = {39, NULL, NULL};
struct Node root_right_right = {48, NULL, NULL};
struct Node root_right_left = {40, NULL, NULL};
struct Node *N;
struct Node *N_left;
struct Node *N_right;
struct Node *N_right_right;
struct Node *N_right_left;
N = &root;
N_left = &root_left;
N_right = &root_right;
N_right_right = &root_right_right;
N_right_left = &root_right_left;
N_right->right = N_right_right;
N_right->left = N_right_left;
N->left = N_left;
N->right = N_right;
int result = 5;
int nodeDataList[result];
int index = 0;
inorder(N, nodeDataList, &index);
printf("\n");
printf("%d\n", nodeDataList[0]);
printf("%d\n", nodeDataList[1]);
printf("%d\n", nodeDataList[2]);
printf("%d\n", nodeDataList[3]);
printf("%d\n", nodeDataList[4]);
}
``
轉載請註明出處，本文鏈接：https://www.uj5u.com/shujuku/346480.html