哈夫曼树是相同个数的带权结点所构成的所有二叉树中带权路径长度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 tre

用C++编的一个小的排序程序，里面用到二叉树等，对新手有点用-Using C++ for a small sort of procedure, which used binary tree and so on, with a bit of novice

用VB制作数据结构课程中的二叉树控件,在VB中学习数据结构及应用的好文章-VB produced in a binary tree data structure courses controls, a good article to learn data structures and application in VB