2011-03-01 105 views
0

下面的程序編譯得很好,但運行時發生錯誤「.exe文件ahs停止工作」。請幫忙。有什麼建議麼?「.exe文件已停止工作」運行時

#include<stdio.h> 
#include<stdlib.h> 
#include<string.h> 

#define MAXSIZE 500 

struct key 
{ 
    int item; 
    struct key *left; 
    struct key *right; 
}; 

typedef struct key star; 

void make_tree(star *link, int j, char a[]); 
int find_num_of_leaves(star *node); 

star *tree; 
char input[MAXSIZE]; 

int main() 
{ 
    int i=0; 
    int num; 

    printf("Enter the number:\n"); 
    scanf("%[^\n]", input); 

    tree = (star *) malloc(sizeof(star)); 
    tree->item = -1; 

    make_tree(tree, i, input); 
    printf("@@@@@@@"); 
    num = find_num_of_leaves(tree); 
    printf("#######"); 
    printf("\n\n%d", num); 

    return(0); 

} 

void make_tree(star *link, int j, char a[]) 
{ 
    if(a[j] == '\0') 
    { 
     link->left = NULL; 
     link->right = NULL; 
     return; 
    } 

    if(a[j+1] == '\0') 
    { 
     link->right = NULL; 
     return; 
    } 

    if(int(a[j]) > 0) 
    { 
     link->left = (star *) malloc(sizeof(star)); 
     (link->left)->item = a[j]; 
     return make_tree(link->left, j+1, a); 
    } 

    if(((10*int(a[j])) + int(a[j+1])) <= 26) 
    { 
     link->right = (star *) malloc(sizeof(star)); 
     (link->right)->item = (10*int(a[j])) + int(a[j+1]); 
     return make_tree(link->right, j+1, a); 
    } 

} 

int find_num_of_leaves(star *node) 
{ 
    if(node == NULL) 
     return 0;  
    if(node->left == NULL && node->right == NULL) 
     return 1; 
    else 
     return find_num_of_leaves(node->left) + find_num_of_leaves(node->right); 
    /*if(node->left == NULL) 
     find_num_of_leaves(node->right); 

    if(node->right == NULL) 
     find_num_of_leaves(node->left); 

    if(node->right != NULL && node->left != NULL) 
    { 
     find_num_of_leaves(node->left); 
     find_num_of_leaves(node->right); 
    }*/ 

} 
+3

你試過調試過嗎? – 2011-03-01 16:57:14

+0

在停止工作之前可以輸入多少物品? – 2011-03-01 16:58:36

+0

甚至不是1 ....它要求input.then打印@@@@@@@然後停止 – 2011-03-01 17:00:11

回答

2

在做讓樹中的鏈路>左如果代碼通過該位不會被初始化: (例如,如果你輸入一個數字到控制檯)

if(a[j+1] == '\0') 
{ 
     link->right = NULL; 
     return; 
} 

因此,當您的代碼調用find_num_of_leaves時,它又調用find_num_of_leaves,它在嘗試解引用節點的左側部分時崩潰。

+0

所以你如何解決? – 2011-03-01 17:15:20

+0

一般來說,如果你正在測試NULL指針(就像你在find_num_of_leaves中一樣),你需要確保這些指針被初始化爲NULL – Jimmy 2011-03-01 17:22:40