资源列表
重发尾插法建立单链表及其遍历
- 用尾插法建立单链表，可以事先不必指定要插入的元素的个数，比较灵活，注意输入数据时以－1结束-tailings interpolation creation of a single-chain and can not designated prior to the insertion of items, a more flexible, pay attention to the input data to the end-1
重发求树高的程序
- 用递归的方法求二叉树的树高，使用时更加灵活，注意输入的数据以－1结束-using recursive method for binary tree height, use a more flexible, pay attention to input data to the end-1
（－1结束）求树高
- 用递归的方法的方法求二叉树的树高，注意输入的节点数据以－1结束。-use recursive methods for the binary tree height, pay attention to input data to the nodes -1 end.
递归中序遍历排序二叉树
- 这是一个中序遍历二叉树的VC实现，要注意的是输入节点后，以－1结束-which is a binary tree traversal sequence VC, to pay attention to the input nodes, in the end -1
二叉排序二叉树的建立
- 二叉排序树的建立是数据结构中许多二叉树算法实现的基础，本程序输入节点时，以－1表示输入结束-two forks of the tree data structure is the establishment of many of the binary tree algorithm based on the input node procedure, said the importation of 1 to the end
链栈的建立及出入栈
- 用链表结构完成堆栈的任务，使用时更加灵活方便-structure with the mandate to complete stack, use more flexible and convenient
求树高
- 数据结构中求二叉树树高的VC实现，其中包括了二叉树的建立过程-data structure for the binary tree height VC, which included a binary tree building process
C_KERMIT
- C语言核心协议的C语言源代码,用于早期网络通信，由哥伦比亚大学开发-C language core protocol C language source code for early network communications, from Columbia University Development
建树和遍历
- 建树和遍历-achievements and Ergodic
双链表正排序
- 双链表正排序-- Ranking List is
CInterpolate
- 插值类 CInterpolate 一元全区间不等距插值 一元全区间等距插值 一元三点不等距插值 连分式不等距插值 埃尔米特不等距插值 光滑不等距插值 二元全区间插值-interpolation category CInterpolate one yuan is not equidistant between the region interpolation one yuan region equidistant between 3:00 interpolation one yuan is
矩形编码压缩
- 矩形编码压缩源代码是针对图象压缩设计的程序，该算法可用于生物信息学，图象处理等方面-rectangular Coding source code is against image compression design process, the algorithm can be used bioinformatics, image processing, etc.