资源列表
BalancedBinaryTree
- 该程序可以帮助初学者了解AVL树。输入一组关键字序列，并以此顺序建立一棵平衡二叉树，并在建树过程中用逆中序法输出每次插入新结点后的平衡二叉树形状。-The program can help beginners learn AVL tree. Enter a set of keywords sequences and in this order to establish balanced binary tree, and the achievements in the process of usi
Haffman
- 将一组数组转换为哈夫曼编码，使用数据结构中的二叉树功能实现-Convert an array to Haffman code
Partition-tree
- 时代的眼泪-划分树 能在对数时间内求取区间第k大值-Partition tree
Hanoi
- c++版，用链式栈实现汉诺塔算法（内附链式栈内模板）-version of c++，realisation of the tower of hanoi with link stack(class pattern attached)
link_queue
- c++链式队列类模板附带调试菜单 1.生成栈 2.显示栈 3.入栈 4.出栈 5.取出栈顶 -class pattern of link queue in version c++
seq_stack
- c++顺序栈类模板带调试菜单 1.生成栈 2.显示栈 3.入栈 4.出栈 5.去栈顶-class pattern of sequence stack in version c++
TVsingradiente
- TV for denoising with step adaptative range selection
extranum
- COBOL: Extrai números de uma String.
Lab
- linked list example with c programming
micro
- microgrid pscad code
AVL
- Test program for AVL trees.
TreeDepth
- 使用深度優先遍歷最小路徑樹，但根源是“使用深度優先遍歷最小路徑樹，但根源是 A -Using depth-first traversal minimum path tree but root is A