C# Implementing Huffman Tree Algorithm

Today I looked at the data structure. One exercise was to build the Huffman tree, so I wrote one in C#.

static void Main(string[] args)
{
    var numbers = new int[] { 1, 3, 3, 3, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7 };

    var treeList = new List<HuffmanTree>();
    (from n in numbers
                     group n by n into g
                     select new HuffmanTree { Value = , Degree = () });

    while (>1)
    {
        var sel = from i in treeList
                 orderby  ascending
                 select i;
        var min = (2).ToArray();

        (new HuffmanTree { Left = min[0], Right = min[1], Degree = min[0].Degree + min[1].Degree });

        (min[0]);
        (min[1]);
    }
}

class HuffmanTree
{
    public HuffmanTree Left { get; set; }
    public HuffmanTree Right { get; set; }

    public int Value { get; set; }
    public int Degree { get; set; }

    public override string ToString()
    {
        return Value + " " + Degree;
    }
}

I wrote this code very directly with LINQ, and after I finished writing it, I was a little surprised: basically every step was completed in just one sentence, and it was all self-commented, and it made people feel very smooth.

Although this implementation is not efficient in operation and there are some areas that can be optimized, I really like this simple, efficient (development efficiency) code, which looks very comfortable. This is also a very fascinating thing about C# -> Elegance: You can express your thoughts in your heart quickly with code, and you can achieve them in one go without being obsessed with details. Many times, when you are struggling to realize the details, you often forget the initial sudden inspiration and the fun of programming.

At the same time, I remembered a post about algorithm practice that I posted a few days ago. Although it can be implemented within 20 lines with C#, a large number of experienced programmers cannot complete it in C language (cannot use any library) within 4 hours. I think people feel completely different when they use 20 lines and 200 lines for the same question.

This is all about this article about C# implementation of Huffman Tree. I hope it will be helpful to everyone's learning and I hope everyone will support me more.