data structures between 2:00 judgment whether a simple path and determine whethe...

数据结构关于多项式相加的源码-the soundcode of data-structure on the additon of the polynomals.

用C++实现的快速傅立叶变换（FFT）的结构算法，其功用就不用细说了吧-C realized Fast Fourier Transform (FFT) algorithm structure, its purpose would not have to elaborate on it

二叉树的基本操作-binary tree as the basic operation

数据结构教程 C-data structure tutorial for c

把老师给的PPT，上传了。 是说数据结构。-The teacher to the PPT, uploaded. Is that data structure.

c语言少见经典资料，jkjsdjfkjdlfdfdfs-c language data rare classic, jkjsdjfkjdlfdfdfs

vfp表单，锁住和解锁数据表。（压缩文件）-Probe form, the lock and unlock data sheets. (Compressed files)

谷歌地图的编码方式，Google earth地图图片编码的qrst算法，包括坐标编号转QRST编码以及QRST编码反转坐标编码的程序

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

一个招聘管理系统-a recruitment management system