c - 不同编译器中的不同答案

Question

代码是实现二叉查找树，第一行是要创建的节点的数据，第二行是要删除的节点的数据，然后按‘层序’打印剩下的树。

当我在 GNU GCC 中执行它时答案是正确的，但是当我在 Linux 版本的 GCC 代码下编译它时输出是错误的：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct Node
{
    int data;
    struct Node* left;
    struct Node* right;
} ;

int count=0;
int height=0;
void print_level_nodes(struct Node* current,int level)
{
    if(current==NULL)
    {
        return;
    }
    else if(level==1)
    {
        if(count>1)
        {
            printf("%d\n",current->data);
        }
        else
        {
            printf("%d",current->data);
        }
        count--;
    }
    else
    {
        print_level_nodes(current->left,level-1);
        print_level_nodes(current->right,level-1);
    }
}

int tree_height(struct Node* node)
{
    if(node==NULL)
    {
        return 0;
    }
    else
    {
        int left_height=tree_height(node->left);
        int right_height=tree_height(node->right);
        if(left_height>right_height)
        {
            return left_height + 1;
        }
        else
        {
            return right_height+1;
        }
    }
}

struct Node* Insert(struct Node* current, int num)
{
    if (current == NULL)
    {
        current = (struct Node*)malloc(sizeof(struct Node));
        current->data = num;
        current->left = NULL;
        current->right = NULL;
    }
    else
    {
        if (num > current->data)
        {
            current->right = Insert(current->right, num);

        }
        else if (num < current->data)
        {
            current->left = Insert(current->left, num);
        }
    }
    return current;
}

struct Node* Find_MIN(struct Node* root)
{
    if (root == NULL)
    {
        return;
    }
    while (root->left!=NULL)
    {
        root->left = Find_MIN(root->left);
    }
    return root;
}

struct Node* Delete(struct Node* root, int num)
{
    if (root == NULL)
    {
        return root;
    }
    if (num < root->data)
    {
        root->left = Delete(root->left,num);
    }
    else if (num > root->data)
    {
        root->right = Delete(root->right,num);
    }
    else
    {
        //0 child
        if (root->left == NULL && root->right == NULL)
        {
            free(root);
            root = NULL;
        }
        //1 child
        else if (root->left != NULL && root->right == NULL)
        {
            struct Node* temp = root;
            root = root->left;
            free(temp);
        }
        else if (root->left == NULL && root->right != NULL)
        {
            struct Node* temp = root;
            root = root->right;
            free(temp);
        }
        //2 child
        else if (root->left != NULL && root->right != NULL)
        {
            struct Node* temp = Find_MIN(root->right);
            root->data = temp->data;
            root->right = Delete(root->right,temp->data);
        }
        return root;
    }
}

int transfer_input(int num[] , char t1[])
{
   int i=0 , tmp=0;
   int index=0;
   while(t1[i]!='\0')
   {
        if(t1[i]==' ')
        {
            num[index++] = tmp;
            tmp=0;
            i++;
            continue;
        }
        else
        {
            tmp*=10;
            tmp+=(t1[i++]-'0');
        }
    }
    num[index] = tmp;
    index++;
    return index;
}

int main()
{
    struct Node* root = NULL;
    char t1[100000] , t2[100000] , tmp;
    int input1[100000] , input2[100000] , length1 , length2;

    scanf("%[^\r\n]",t1);
    scanf("%c",&tmp);
    if(tmp=='\r')
    {
        scanf("%c",&tmp);
    }
    scanf("%[^\r\n]",t2);
    if(tmp=='\r')
    {
        scanf("%c",&tmp);
    }
    length1 = transfer_input(input1 , t1);
    length2 = transfer_input(input2 , t2);

    for(int i=0 ; i<length1 ; i++)
    {
        root = Insert(root , input1[i]);
        count++;
    }
    for(int i=0 ; i<length2 ; i++)
    {
        if(length2==0)
        {
            break;
        }
        else if(length2!=0)
        {
            root = Delete(root , input2[i]);
            if(input2[i]>0)
            {
                count--;
            }
        }
    }
    height=tree_height(root);
    printf("height = %d",height);
    
    for(int i=1;i<=height;i++)
    {
        print_level_nodes(root,i);
    }
    
    return 0;
}

标签： c