利用C语言编写软件实现上述功能。具体要求为：从键盘任意输入一个由英文字母构成的文本字符串，例如“ilikelearningdatastructurecourse”，首先根据该字符串创建Huffman树，之后进行Huffman编码，然后把该字符串的Huffman编码结果向屏幕输出。能够利用前述的Huffman编码结果对某0-1码流进行解码得到字符串

好的，这是一个很有挑战性的问题。首先，我们需要实现Huffman树的创建和Huffman编码的算法。然后，我们需要把输入的字符串转换为Huffman编码，并把编码结果输出到屏幕上。最后，我们需要实现解码的算法，使得我们能够从Huffman编码中还原出原始字符串。

下面是一个可能的C语言实现：

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

#define MAX_CHARACTERS 256

typedef struct node {
    char character;
    int frequency;
    struct node *left, *right;
} Node;

typedef struct code {
    char character;
    char *bits;
} Code;

Node *create_node(char character, int frequency, Node *left, Node *right) {
    Node *node = (Node *) malloc(sizeof(Node));
    node->character = character;
    node->frequency = frequency;
    node->left = left;
    node->right = right;
    return node;
}

void destroy_node(Node *node) {
    if (node) {
        destroy_node(node->left);
        destroy_node(node->right);
        free(node);
    }
}

int compare_nodes(const void *a, const void *b) {
    const Node *node1 = *(const Node **) a;
    const Node *node2 = *(const Node **) b;
    return node1->frequency - node2->frequency;
}

Node *build_huffman_tree(int *frequencies) {
    int i;
    Node *nodes[MAX_CHARACTERS];
    int num_nodes = 0;
    for (i = 0; i < MAX_CHARACTERS; i++) {
        if (frequencies[i] > 0) {
            nodes[num_nodes++] = create_node((char) i, frequencies[i], NULL, NULL);
        }
    }
    while (num_nodes > 1) {
        qsort(nodes, num_nodes, sizeof(Node *), compare_nodes);
        Node *left = nodes[0];
        Node *right = nodes[1];
        Node *parent = create_node('\0', left->frequency + right->frequency, left, right);
        nodes[0] = parent;
        nodes[1] = nodes[--num_nodes];
    }
    return nodes[0];
}

void build_codes(Node *node, Code *codes, char *bits, int num_bits) {
    if (node->left) {
        bits[num_bits] = '0';
        build_codes(node->left, codes, bits, num_bits + 1);
    }
    if (node->right) {
        bits[num_bits] = '1';
        build_codes(node->right, codes, bits, num_bits + 1);
    }
    if (!node->left && !node->right) {
        codes[node->character].character = node->character;
        codes[node->character].bits = (char *) malloc((num_bits + 1) * sizeof(char));
        strncpy(codes[node->character].bits, bits, num_bits);
        codes[node->character].bits[num_bits] = '\0';
    }
}

void destroy_codes(Code *codes) {
    int i;
    for (i = 0; i < MAX_CHARACTERS; i++) {
        if (codes[i].bits) {
            free(codes[i].bits);
        }
    }
}

char *encode(char *text, Code *codes) {
    int i, j, k;
    int length = strlen(text);
    char *bits = (char *) malloc(length * MAX_CHARACTERS * sizeof(char));
    for (i = 0, k = 0; i < length; i++) {
        Code code = codes[text[i]];
        for (j = 0; j < strlen(code.bits); j++, k++) {
            bits[k] = code.bits[j];
        }
    }
    bits[k] = '\0';
    return bits;
}

char *decode(char *bits, Node *root) {
    int i, j, k;
    int length = strlen(bits);
    char *text = (char *) malloc((length / 8 + 1) * sizeof(char));
    for (i = 0, k = 0; i < length; ) {
        Node *node = root;
        while (node->left && node->right) {
            if (bits[i] == '0') {
                node = node->left;
            } else {
                node = node->right;
            }
            i++;
        }
        text[k++] = node->character;
    }
    text[k] = '\0';
    return text;
}

int main() {
    char text[MAX_CHARACTERS];
    int frequencies[MAX_CHARACTERS] = {0};
    int i;
    printf("Enter a text string: ");
    scanf("%s", text);
    for (i = 0; i < strlen(text); i++) {
        frequencies[text[i]]++;
    }
    Node *root = build_huffman_tree(frequencies);
    Code codes[MAX_CHARACTERS];
    char bits[MAX_CHARACTERS];
    build_codes(root, codes, bits, 0);
    char *encoded = encode(text, codes);
    printf("Encoded: %s\n", encoded);
    char *decoded = decode(encoded, root);
    printf("Decoded: %s\n", decoded);
    destroy_node(root);
    destroy_codes(codes);
    free(encoded);
    free(decoded);
    return 0;
}

这个程序首先从标准输入中读取一个字符串，然后计算每个字符出现的频率，并使用这些频率构建Huffman树。然后，它使用该树构建字符的编码表，并将输入字符串编码为Huffman编码。最后，它使用Huffman编码和Huffman树来还原原始字符串，并将其输出到标准输出中。

这个程序使用了一些C语言的标准库函数，例如`malloc()`、`free()`、`qsort()`和`strncpy()`。如果你不熟悉这些函数，可以查找相应的文档来了解它们的用法。