哈夫曼树是相同个数的带权结点所构成的所有二叉树中带权路径长度WPL最小的二叉树，将其应用于计算机通信中数据编码技术可大大缩短电文代码的长度，且避免了电文代码二义性的产生。本文简要介绍了哈夫曼树的原理、构造方法及其在数据编码中的应用。-Huffman tree is the same as the number of nodes with the right posed by the Binary right path with the smallest length WPL binary tree and applied to computer communications data coding technology can greatly shorten the length of the message code, the message to avoid ambiguity code generation. This paper describes the principle of the Huffman tree, construction methods and data coding applications.