班级管理系统

用vc基于数据库编程源代码-with vc-based database programming source code

PB的数据窗口的例子,有约会,K线图等等,由此可以学习国外高手的编程技巧与经验-PB data window examples are dating, K map, etc., which can learn from foreign experts in the programming skills and experience

数据结构的实验报告-structure of the experimental data report

MAPX开发基础程序，实现简单的地图控制操作-MAPX the basis of procedures developed to achieve a simple map control operations

没什么特别的 用ASSECC数据库~――~-Nothing special with ASSECC database ~- ~

收费系统我的第一个系统-system of a system

多个Huffman编码、解码器的程序，对数据结构的学习者很有用。-over Huffman encoding, decoding device procedures, data structures useful to learners.

数据结构（清华版），数据结构课后小作业，选择其中较之重点而写 -Data structure (Tsinghua version), data structure after a small operation, select one of the focus than the written

数据结构课程的作业，代码通俗易懂，且运行效率高。-Data structure course work, the code easy to understand, and operating efficiency.

数 据 结 构 大型 作业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