哈夫曼树

using System;
using System.Collections.Generic;
using System.Linq;

namespace 哈夫曼树
{
    class Program
    {
        public static List<HuffmanNode> huffmanNodes= new List<HuffmanNode>();//哈夫曼树节点集合
        public static List<Node> nodes = new List<Node>();//基本节点集合 只有数值和权重
        static void Main(string[] args)
        {
            //添加节点(权重,字符)
            nodes.Add(new Node(5, "a"));
            nodes.Add(new Node(32, "b"));
            nodes.Add(new Node(18, "c"));
            nodes.Add(new Node(7, "d"));
            nodes.Add(new Node(25, "e"));

            //将每个节点转换成哈夫曼树的节点
            foreach (var node in nodes)
            {
                HuffmanNode huffman = new HuffmanNode();
                huffman.value = node.Value;
                huffman.weight = node.Weight;
                huffmanNodes.Add(huffman);
            }

            //生成哈夫曼树
            while (huffmanNodes.Count > 1)
            {
                //将所有节点按权重升序排序
                var sort =
                    from node in huffmanNodes
                    orderby node.weight
                    select node;
                //选出权重最小的两个节点
                var min = sort.Take(2).ToArray();
                //生成一个父节点 权重为两个权重最小节点的权重和
                HuffmanNode huffman = new HuffmanNode();
                huffman.weight = min[0].weight + min[1].weight;
                huffman.left = min[0];
                huffman.right = min[1];
                //为两个权重最小节点添加父节点
                min[0].parent = huffman;
                min[1].parent = huffman;
                //在集合中移除两个最小节点
                huffmanNodes.Remove(min[0]);
                huffmanNodes.Remove(min[1]);
                //将父节点添加进集合中
                huffmanNodes.Add(huffman);
            }

            visitTree(huffmanNodes[0], " "," " );

            Console.ReadKey();
        }

        //哈夫曼编码输出 左子树为0 右子树为1
        public  static void visitTree(HuffmanNode node, String prefixStr, String addStr)
        {
            if (node != null)
            {
                if (!string .IsNullOrEmpty(node.value))
                    Console.WriteLine(node.value.ToString() + ":" + prefixStr + addStr);
                visitTree(node.left, prefixStr + addStr, "0");
                visitTree(node.right, prefixStr + addStr, "1");
            }
        }
    }

    /// <summary>
    /// 定义个Node节点类 用于添加操作
    /// </summary>
    public class Node
    {
        public int Weight { get; set; }//权重
        public String Value { get; set; }//值
        public Node(int weight, string value)
        {
            Weight = weight;
            Value = value;
        }
    }

    /// <summary>
    /// 哈夫曼树节点类
    /// </summary>
    public class HuffmanNode
    {
        public int weight;//权重
        public String value = "";//值
        public HuffmanNode parent;//父节点
        public HuffmanNode left;//左孩子
        public HuffmanNode right;//右孩子

    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
哈夫曼树(Huffman Tree)是一种特殊的二叉树,用于数据压缩和编码。它的构建过程是根据字符出现的频率来确定每个字符的编码,使得出现频率高的字符具有较短的编码,而出现频率低的字符具有较长的编码。 以下是一个Python实现的哈夫曼树的例子: ```python class TreeNode: def __init__(self, value, freq): self.value = value self.freq = freq self.left = None self.right = None def build_huffman_tree(char_freq): nodes = [TreeNode(char, freq) for char, freq in char_freq.items()] while len(nodes) > 1: nodes = sorted(nodes, key=lambda x: x.freq) left_node = nodes.pop(0) right_node = nodes.pop(0) parent_node = TreeNode(None, left_node.freq + right_node.freq) parent_node.left = left_node parent_node.right = right_node nodes.append(parent_node) return nodes[0] def encode_huffman_tree(root, code='', codes={}): if root is None: return if root.value is not None: codes[root.value] = code encode_huffman_tree(root.left, code + '0', codes) encode_huffman_tree(root.right, code + '1', codes) return codes def decode_huffman_tree(root, encoded_text): decoded_text = '' current_node = root for bit in encoded_text: if bit == '0': current_node = current_node.left else: current_node = current_node.right if current_node.value is not None: decoded_text += current_node.value current_node = root return decoded_text # 示例用法 char_freq = {'a': 5, 'b': 9, 'c': 12, 'd': 13, 'e': 16, 'f': 45} huffman_tree = build_huffman_tree(char_freq) huffman_codes = encode_huffman_tree(huffman_tree) encoded_text = ''.join([huffman_codes[char] for char in 'abcdef']) decoded_text = decode_huffman_tree(huffman_tree, encoded_text) print("Huffman Codes:", huffman_codes) print("Encoded Text:", encoded_text) print("Decoded Text:", decoded_text) ```

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值