资源列表
双链表正排序
- 双链表正排序-- Ranking List is
建树和遍历
- 建树和遍历-achievements and Ergodic
C_KERMIT
- C语言核心协议的C语言源代码,用于早期网络通信，由哥伦比亚大学开发-C language core protocol C language source code for early network communications, from Columbia University Development
求树高
- 数据结构中求二叉树树高的VC实现，其中包括了二叉树的建立过程-data structure for the binary tree height VC, which included a binary tree building process
链栈的建立及出入栈
- 用链表结构完成堆栈的任务，使用时更加灵活方便-structure with the mandate to complete stack, use more flexible and convenient
递归中序遍历排序二叉树
- 这是一个中序遍历二叉树的VC实现，要注意的是输入节点后，以－1结束-which is a binary tree traversal sequence VC, to pay attention to the input nodes, in the end -1
（－1结束）求树高
- 用递归的方法的方法求二叉树的树高，注意输入的节点数据以－1结束。-use recursive methods for the binary tree height, pay attention to input data to the nodes -1 end.
重发求树高的程序
- 用递归的方法求二叉树的树高，使用时更加灵活，注意输入的数据以－1结束-using recursive method for binary tree height, use a more flexible, pay attention to input data to the end-1
重发尾插法建立单链表及其遍历
- 用尾插法建立单链表，可以事先不必指定要插入的元素的个数，比较灵活，注意输入数据时以－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
forgive
- joseph的程序对很多C初学者有着很大的帮助，用C++程序实现的-many of the procedures C beginners have great help with the C Programming
数据结构课设
- 用c编写的数据内部排序方法,可在窗口中选择多种排序方法,如快排,冒泡,折半插入等,还可以选择排序数据的个数,初态,控制等.-using data prepared by the internal order, the window can choose a variety of sequencing methods, such as fast Pai, bubbling half insert, can also choose the number of original data, the i
数据结构实验与实训教程
- 数据结构实验与实训教程 书籍语言： 简体中文 书籍类型： 程序设计 授权方式： 免费软件 书籍大小： 1.7 MB -experimental data structure and Training Guide books Language : English books categories : program design license : free software books Size : 1.7 MB