登录脚本，PHP连接数据库的使用。

绿色征途2 本帖最后由 quyan123456789 于 2013-8-28 16:59 编辑 $ Z: [. G6 {& h6 u  M) M1 e* B 帖子发了将近有1年时间了，现在成了置顶帖很高兴

拖动开发代码，关于pb 的-Drag code on the pb

双数组建树代码，简单扩张就可以使用的，欢迎大家下载使用-achieved double-array code, the simple expansion could use, we welcome downloading

对给定书的总页码，计算出书的全部页码中分别用到多少次数字0，1，2，3...9.-DataStatistics

毕业生管理系统:分为六个模块：身份验证模块、毕业生资料模块,考试成绩录入模块、通信录及数据输出与系统设置模块、毕业生成绩统计模块、数据库维护模块。-Graduate management systems: divided into six modules: authentication modules, graduates of information modules, examination results entry module, communications were recorded and the data output and system settings module, graduates accomplishments statistics module, database maintenance module.

希望对大家有用，大家多上载一些数据结构（C）的东东啊。-hope useful for all, everyone on the data structure (C) Advantage.

这是一个用于计算最小生成树的程序。当人们逐个输入每条边的权，再点击生成，便能得到这个图的最小生成树。-This is a used to calculate the minimum spanning tree procedure. When people enter one by one each side of the right, then click generate, will be able to get this graph minimum spanning tree.

一个自己定义的数组外包装，这是“使用者自定义stl容器“的一个好例子，在数组之外包装了一层常用的容器界面。-own definition of an array overpack, which is a "user-defined stl containers" of a good example In addition to the array of packaging containers used layer interface.

数据结构 之骑士周游算法-data structure Cavaliers travel Algorithm

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