音乐设计的ＤＯＳ下的程序，显示键盘的按牛，急口令．

本程序是在VC下开发的Windodws窗口界面程序,根据数据库中的记录向树型控件中添加节点。-this procedure was developed under the VC Windodws window interface procedures, according to records in the database to add controls tree nodes.

是Delphi下的TreeList型的控件，功能很强大，带有Demo和说明文件可参考。-Delphi is under the control of TreeList type, function very powerful, with Demo and reference documentation.

VC编程中MFC中的树状结构的拖拽操作实例，个人收集，感觉还不错，希望大家一起共享-MFC programming in VC in the tree structure of the drag operation examples, personal collection, feel good, I hope to share with everyone

能自动遍历文件夹下文件，并将其显示到列表框中。(It can look for the files of the folder automaticlly and display the data to edit .)

本程序是一个外观非常好看的树型控件,可以显示多个颜色,图等.-This procedure is a very good-looking appearance tree control, can display multiple colors, such as Fig.

TREE控件的新用法-TREE control of the new usage

CTreeFileCtrl

用XML和TreeView实现无限分类的递归调用，主要是用在管理系统下面的。利用frame框架做的一个小示例-Using XML and TreeView classification unlimited recursive calls, is mainly used in the management of the system below. Framework for the use of frame to do a small sample

研究生省考的词汇部分，是咱老师的杰作，很有帮助，看看是否属实-postgraduate provincial exams, vocabulary, is a masterpiece from our teachers and very helpful to see whether it is true

This project is to show the tree I dreamed when I first met the ternary tree concept. When I came upon the ternary tree, I get awed! It s amazing that an idea so simplistic could be so strong and fast. But it had flaws... the first one is the memory consumption. The hash table implementation consumes far less memory than the ternary tree! The second flaw is the ternary tree can be fragmented and be extremely unbalanced (as the algorithm doesn t do any balancing step) so the tree also needs a way for balancing the nodes. I tried to reduce the memory consumption by grouping three nodes into one new "int" node. -This project is to show the tree I dreamed wh en I first met the ternary tree concept. When I ca me upon the ternary tree, I get awed! It"s amazing that an idea so simplisti c could be so strong and fast. But it had flaws ... the first one is the memory consumption. The has h table implementation consumes far less memor y than the ternary tree! The second flaw is the te rnary