销售和库存系统

数据结构C++代码-data structure C code

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

基于VISUAL C++开发的运动会的评分系统，属于 数据结构-Based on the VISUAL C++ Games developed scoring system, which data structure

一个学生管理系统的常见功能是支持个人的维护和研究信息与有关的一名学生。下面的源代码和例子用于在 Java 中的学生管理系统。 在项目文件部分中列出的源代码和包含在此项目中的文件，请确保列出的源代码，该代码是否满足您的需要那里

DLT2007新电力规约EXCEL版，花了一个星期制作而成，便于查询和制作电力软件数据库-DLT2007 new electric version of the Statute of _EXCEL spent a week made of the purposes of interrogation and the production of electric power software database

Las Vegas，KMP，Mentro carlo这三种模式匹配算法的原代码，对其进行了时间及出错率的比较-Las Vegas, KMP, Mentro carlo three pattern matching algorithm of the original code, its time and the error rate comparison

这是数据结构中模拟栈的一个精典例子利用火车进站出站模拟出栈和入栈-This is the data structure of a simulated stack classic examples of using the train station stop simulated stack and pushed

红黑树实现, 红黑树实现,红黑树实现-Red and black tree realize, realize black tree, a red, black tree realize

数据结构停车场问题-data structure parking problems

ＰＯＪ　１００１己ＡＣ源代码，不信你可以试试．-POJ 1001 F AC source code, do not believe you can try.