结构链接列表的示例

实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.

简单的servlet/jsp注册，包括三个页面和一个servlet,虽然小一点，但是框架比较全，表单验证的js没写了，希望用的时候自己加上-Simple servlet/jsp Register, including the three pages and a servlet, although smaller, but the whole framework of comparison, the form validation js did not write, and hope to use the time to add their own

数据结构中树的相关操作,希望对大家有用!thanks-tree data structure of operation, we hope to useful! Thanks

数据库源码-source database.

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作-focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)

题目：设计一个题目，演示用算符优先法对算术表达式求值的过程。 概要设计 1、顺序扫描中缀算术表达式，当读到数字时直接将其送至输出队列中； 2、当读到运算符时，将栈中所有优先级高于或等于该运算符弹出，送至输出队列中，再将当前运算符入栈； 3、当读入左括号时，即入栈； 4、当读到右括号时，将靠近栈顶的第一个左括号上面的运算符全部一次弹出，送至输出队列中，再删除栈中的左括号。 5、使用VS栈来存储读入的操作和运算结果，然后进行数字字符到数值的转换。 -Title: Design of a topic, presentation operator priority method with arithmetic expression evaluation process. Summary of design 1, the order of scanning arithmetic infix expressions, when they read numbers directly to the output queue 2, when they read operator, it will stack all priority higher than or equal to the operator pop-up , sent to the output queue, and then the current operator入栈 3, when read left brackets, that is, when入栈 4, when they read the right brackets, it will be near the Top-left of the first operator in brackets above All a pop-up, sent to the output queue, and then delete stacks of left brackets. 5, the use of VS stack to store read operation and computing the results of numeric characters and then proceed to the numerical co

图论算法，旅行推销员问题，很有趣。 可算出图中的哈米尔顿回路-graph algorithm, traveling salesman problem, very interesting. Map can be calculated totally dominated the circuit

药店管理系统；

phpMyAdmin是一个以PHP为基础，以Web-Base方式架构在网站主机上的MySQL的资料库管理工具。phpMyAdmin 可以管理整个MySQL服务器(需要超级用户)，也可以管理单个数据库。为了实现后一种，你将需要合理设置MySQL用户，他只能对允许的数据库进行读/写。那要等到你看过MySQL手册中相关的部分。   phpMyAdmin 4.1.0 rc3 更新日志：2013-12-7 phpMyAdmin 4.1.0 第三个候选版本发布，此版本包含了很多重大改进和bug修复 phpMyAdmin 4.1.0 现在最低支持PHP 5.3 版本和 MySQL 5.5 版本。 以下是一些重大的改进： *当连接控制主机时可以指定端口 *创