一个代码从AVL树中删除第c个最小的元素，使用最大堆来找到第c个最小的元素，在mac上给出正确的输出，但在windows终端上没有返回正确的值。我附上下面的代码。也许它必须与指针初始化。一定要让我知道。还有一个问题是，第c个最小的元素的值在windows上是0。

#include <stdio.h>
#include <stdlib.h>
#include "../helpers/helpers.h"
#include "../prng/mt64.h"
#include "q2.h"

int main(int argc, char *argv[])
{

    // Make sure we have a seed
    if (argc != 3)
    {
        printf("Usage: %s <seed> <array_length>\n", argv[0]);
        exit(1);
    }

    init_genrand64(atoi(argv[1])); // Set the seed for the random number generator

    // Accept the length of the lists from the command line
    int l = atoi(argv[2]);

    // Generate the random array
    unsigned int *arr = generateRandomNumbers(l);
    printf("Random Array: ");
    printArray(arr, l);

    // Part A: Construct the tree and print it inorder after every insertion
    tNode *root = NULL;

    for (int x = 0; x < l; x++)
    {
        root = insertTree(root, arr[x]);
        printf("Inorder: ");
        inorderTree(root);
        printf("\n");
    }

    // Part B: Delete the 4th, 5th and 6th smallest elements and print the tree inorder after each deletion
    int c = 4;
    cNode *centreNode = (cNode *)malloc(sizeof(cNode));
    //  your code here
    int *result = NULL;
    centreNode->maxHeapSize = 0;
    for (int i = 0; i < l; i++)
    {
        centreNode->maxHeap = insertMaxHeap(centreNode->maxHeap, &centreNode->maxHeapSize, arr[i]);
    }
    for (int i = 0; i < 2; i++)
    {
        result = CthSmallest(centreNode->maxHeap, centreNode->maxHeapSize, c + i);
        int elementToDelete = *result;
        printf("The %dth smallest element is: %d\n", c + i, elementToDelete);
        root = deleteTree(root, elementToDelete);
        inorderTree(root);
        printf("\n");
        centreNode->maxHeapSize = 0;
        for (int i = 0; i < l; i++)
        {
            if (arr[i] == elementToDelete)
            {
                continue;
            }
            centreNode->maxHeap = insertMaxHeap(centreNode->maxHeap, &centreNode->maxHeapSize, arr[i]);
        }
    }
    result = CthSmallest(centreNode->maxHeap, centreNode->maxHeapSize, 7);
    int elementToDelete = *result;
    printf("The %dth smallest element is: %d\n", 6, elementToDelete);
    root = deleteTree(root, elementToDelete);
    inorderTree(root);
    printf("\n");
    return 0;
}

int *CthSmallest(int *arr, int n, int c)
{
    // return maxHeap[0];
    int iter = n - c;
    int *size = &n;
    for (int i = 0; i < iter; i++)
    {
        extractMax(arr, size);
    }
    int j = arr[0];
    int *cth = &j;
    return cth;
}

int extractMax(int *arr, int *len)
{
    // return max;
    if (*len <= 0)
    {
        // Handle heap is empty
        return -1;
    }

    int root = arr[0];
    arr[0] = arr[(*len) - 1];
    (*len)--;
    heapifyMax(arr, *len, 0);

    return root;
}

字符串