a very good code!!!一个非常好的界面美化的程序，非常适合做界面的程序员看...

avl-tree for data structures

分页式编程的源代码，asp语言环境，比较经典。-Tabbed programming source code, asp language environment, compare the classic.

ListView和TreeViee混合在一起的控件-The control which mix listview and treeview

说明：  本人本科的毕业设计,基于Serpent密码的回退N协议的数据传输,希望可供大家参考,谢谢诶！(My undergraduate graduation design, based on the Serpent password fallback N protocol data transmission, I hope you can refer to, thank you!)

相关性分析的算法写得不好，主要供学习matlab界面编写、参数传递的朋友参考-,matlab,其他小程序/Other windows programs -correlation analysis algorithm is not well written, mainly for the preparation of learning Matlab interface, Parameter Passing reference to the friends- and Matlab. other small procedures/Other Windows programs

一个简单了用MFC做的树状控件,希望有帮助-A simple to do with MFC tree control, hope that has helped

说明：  一篇优秀的关于有效的自适应中值滤波器论文(An excellent thesis on effective Adaptive median filte)

DevExpress系列，演示数据树状列表。是Treeview与Listview的结合体。(DevExpress Series, demo data tree list. Is Treeview and Listview combination.)

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

树的节点一般是通过递归函数显示，此处是通过网络的逐级缓冲显示树的节点。-tree nodes is usually through a recursive function, here is the network gradually buffer tree nodes.