我一直在看用c语言进行霍夫曼编码的熵编码和解码的代码，我似乎找不到为什么我总是得到分割错误的原因。

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

const int MAX_TREE_HT = 100;

struct MinHeapNode {
    char data;
    unsigned freq;
    struct MinHeapNode* left, * right;
};

struct MinHeap {
    unsigned size;
    unsigned capacity;
    struct MinHeapNode** array;
};

struct MinHeapNode* newNode(char data, unsigned freq) {
    struct MinHeapNode* temp = (struct MinHeapNode*)malloc(sizeof(struct MinHeapNode));
    temp->left = temp->right = NULL;
    temp->data = data;
    temp->freq = freq;
    return temp;
}

struct MinHeap* createMinHeap(unsigned capacity) {
    struct MinHeap* minHeap = (struct MinHeap*)malloc(sizeof(struct MinHeap));
    minHeap->size = 0;
    minHeap->capacity = capacity;
    minHeap->array = (struct MinHeapNode**)malloc(minHeap->capacity * sizeof(struct MinHeapNode*));
    return minHeap;
}

void swapMinHeapNode(struct MinHeapNode** a, struct MinHeapNode** b) {
    struct MinHeapNode* t = *a;
    *a = *b;
    *b = t;
}

void minHeapify(struct MinHeap* minHeap, int idx) {
    int smallest = idx;
    int left = 2 * idx + 1;
    int right = 2 * idx + 2;

    if (left < minHeap->size && minHeap->array[left]->freq < minHeap->array[smallest]->freq)
        smallest = left;

    if (right < minHeap->size && minHeap->array[right]->freq < minHeap->array[smallest]->freq)
        smallest = right;

    if (smallest != idx) {
        swapMinHeapNode(&minHeap->array[smallest], &minHeap->array[idx]);
        minHeapify(minHeap, smallest);
    }
}

int isSizeOne(struct MinHeap* minHeap) {
    return (minHeap->size == 1);
}

struct MinHeapNode* extractMin(struct MinHeap* minHeap) {
    struct MinHeapNode* temp = minHeap->array[0];
    minHeap->array[0] = minHeap->array[minHeap->size - 1];
    --minHeap->size;
    minHeapify(minHeap, 0);
    return temp;
}

void insertMinHeap(struct MinHeap* minHeap, struct MinHeapNode* minHeapNode) {
    ++minHeap->size;
    int i = minHeap->size - 1;
    minHeap->array[i] = minHeapNode;
    while (i && minHeap->array[i]->freq < minHeap->array[(i - 1) / 2]->freq) {
        swapMinHeapNode(&minHeap->array[i], &minHeap->array[(i - 1) / 2]);
        i = (i - 1) / 2;
    }
}

void buildMinHeap(struct MinHeap* minHeap) {
    int n = minHeap->size - 1;
    int i;
    for (i = (n - 1) / 2; i >= 0; --i)
        minHeapify(minHeap, i);
}

void printArr(int arr[], int n) {
    int i;
    for (i = 0; i < n; ++i)
        printf("%d", arr[i]);
    printf("\n");
}

int isLeaf(struct MinHeapNode* root) {
    return !(root->left) && !(root->right);
}

struct MinHeap* createAndBuildMinHeap(char data[], int freq[], int size) {
    struct MinHeap* minHeap = createMinHeap(size);
    int i;
    for (i = 0; i < size; ++i)
        minHeap->array[i] = newNode(data[i], freq[i]);
    minHeap->size = size;
    buildMinHeap(minHeap);
    return minHeap;
}

struct MinHeapNode* buildHuffmanTree(char data[], int freq[], int size) {
    struct MinHeapNode *left, *right, *top;
    struct MinHeap* minHeap = createAndBuildMinHeap(data, freq, size);
    while (!isSizeOne(minHeap)) {
        left = extractMin(minHeap);
        right = extractMin(minHeap);
        top = newNode('$', left->freq + right->freq);
        top->left = left;
        top->right = right;
        insertMinHeap(minHeap, top);
    }
    return extractMin(minHeap);
}

void printCodes(struct MinHeapNode* root, int arr[], int top) {
    if (root->left) {
        arr[top] = 0;
        printCodes(root->left, arr, top + 1);
    }
    if (root->right) {
        arr[top] = 1;
        printCodes(root->right, arr, top + 1);
    }
    if (isLeaf(root)) {
        printf("%c: ", root->data);
        printArr(arr, top);
    }
}

void HuffmanCodes(char data[], int freq[], int size) {
    struct MinHeapNode* root = buildHuffmanTree(data, freq, size);
    int arr[MAX_TREE_HT], top = 0;
    printCodes(root, arr, top);
}

void encode(char* str, char* encoded_str, struct MinHeapNode* root) {
    if (root == NULL)
        return;
    if (isLeaf(root)) {
        while (*str != root->data)
            str++;
        while (*str == root->data) {
            *encoded_str = '1';
            encoded_str++;
            str++;
        }
        return encode(str, encoded_str, root);
    }
    if (*str == root->data) {
        *encoded_str = '0';
        encoded_str++;

        encode(str + 1, encoded_str, root->left);
    } else {
        encode(str, encoded_str, root->right);
    }
}

void decode(char* encoded_str, struct MinHeapNode* root, char* decoded_str) {
    struct MinHeapNode* curr = root;
    while (*encoded_str) {
        if (*encoded_str == '0')
            curr = curr->left;
        else
            curr = curr->right;
        if (isLeaf(curr)) {
            *decoded_str = curr->data;
            decoded_str++;
            curr = root;
        }
        encoded_str++;
    }
}

int main() {
    char str[] = "this is a test";
    int freq[256] = { 0 };
    int size = 0, i;
    for (i = 0; str[i]; i++) {
        freq[str[i]]++;
        size++;
    }
    int unique = 0;
    char data[size];
    for (i = 0; i < 256; i++) {
        if (freq[i]) {
            data[unique] = (char)i;
            unique++;
        }
    }
    HuffmanCodes(data, freq, unique);
    char encoded_str[100], decoded_str[100];
    struct MinHeapNode* root = buildHuffmanTree(data, freq, unique);
    encode(str, encoded_str, root);
    printf("Encoded string: %s\n", encoded_str);
    decode(encoded_str, root, decoded_str);
    printf("Decoded string: %s\n", decoded_str);
    return 0;
}

经过几次逐节注解的尝试和错误，我们发现它是在编码函数内部的某个地方引起的。这不是我自己写的代码，是用一些在线参考编写的。输出应该是下面的。

: 00
a: 010
e: 011
h: 100
i: 1010
s: 1011
t: 110
Encoded string: 0101110101011101110111111001101
Decoded string: this is a test

相反，我得到了以下内容。

a: 0
e: 10
h: 110
i: 1110
s: 11110
 : 111110
t: 111111
zsh: segmentation fault

先谢谢你的帮助。