a good Attendance Management System

共有4个数据结构的实例-a total of four examples of the data structure

应用背景这是一个用定时器来处理网上考试的示例代码。你可以在文件上面指定的JavaScript文件的时间。在这里声明全局变量为计时器。设置时间。关键技术数据库：1。创建一个空数据库命名为testexam或如果你想要不同的然后你可以当执行你所设置的数据库的名称查询。2。执行该项目所附的查询。3。在表中添加至少10个问题和答案。4。必须在正确的字段中指定选择号码。例如： ；如果你的答案是选项设置为1。

数据结构：有关树所有操作- Construction of data: The related tree all operates

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

严蔚敏数据结构的源c代码，非常的经典，很适合初学者的使用-YAN Wei-min data structure c source code, very classic, very suitable for beginners to use

实用的档案管理程序-usable file management procedures

数据结构和算法：包含各种算法，还有一个演示系统-data structures and algorithms : algorithms contained, a demonstration system

在llinux 服务器下，比较通用的oracle安装步骤和脚本，很实用的哟！

基于二叉树的图最有路径算法，在图能转化到二叉树表示时，可求解-the best path based on binary tree

省市区县(含全国完整数据库)Ajax代码，功能详细，可完全适用。-Provincial and municipal districts and counties (including the national integrity of the database) Ajax code, functional details can be fully applicable.