霍夫曼树是一种用于数据压缩的树形结构,它根据字符出现的频率来构建。在C#中,我们可以使用优先队列和哈希表来实现霍夫曼树。
以下是一个简单的示例,它创建了一个霍夫曼树,并打印出每个字符的频率:
using System;
using System.Collections.Generic;
class Node
{
public char Character { get; set; }
public int Frequency { get; set; }
public Node Left { get; set; }
public Node Right { get; set; }
}
class Program
{
static void Main(string[] args)
{
// 输入字符串
string text = "this is an example for huffman tree";
// 计算字符频率
Dictionary<char, int> frequency = new Dictionary<char, int>();
foreach (char c in text)
{
if (frequency.ContainsKey(c))
frequency[c]++;
else
frequency[c] = 1;
}
// 创建优先队列
List<Node> priorityQueue = new List<Node>();
foreach (KeyValuePair<char, int> pair in frequency)
{
Node node = new Node() { Character = pair.Key, Frequency = pair.Value };
priorityQueue.Add(node);
}
priorityQueue.Sort((a, b) => a.Frequency.CompareTo(b.Frequency));
// 构建霍夫曼树
Node root = null;
while (priorityQueue.Count > 1)
{
Node left = priorityQueue[0];
Node right = priorityQueue[1];
priorityQueue.RemoveRange(0, 2);
Node parent = new Node() { Character = '-', Frequency = left.Frequency + right.Frequency };
parent.Left = left;
parent.Right = right;
priorityQueue.Add(parent);
priorityQueue.Sort((a, b) => a.Frequency.CompareTo(b.Frequency));
root = parent;
}
// 打印霍夫曼树
PrintTree(root, 0);
}
static void PrintTree(Node node, int depth)
{
if (node == null)
return;
if (node.Character != '-')
Console.WriteLine("Character: {0}, Frequency: {1}", node.Character, node.Frequency);
else
Console.WriteLine("{" + new string('\t', depth) + "Depth: " + depth + "}");
PrintTree(node.Left, depth + 1);
PrintTree(node.Right, depth + 1);
}
}
这个程序首先计算输入字符串中每个字符的频率,然后创建一个优先队列并将每个字符作为节点添加到队列中。然后,它从队列中取出两个频率最低的节点,将它们合并为一个新的父节点,并将新的父节点添加回队列。这个过程一直持续到队列中只剩下一个节点,这个节点就是霍夫曼树的根节点。最后,程序打印出霍夫曼树的结构。