C# 串行端口

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -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.

一个简单的网上书店系统，运行环境是ASP+ACCESS.具体功能为添加书籍，点击浏览，购买等等。-A simple online bookstore system, runtime environment is ASP+ ACCESS. Add specific functionality for the books, click on browse, purchase and so on.

北大ACM1003（Hangover）-North ACM1003 (Hangover)

能对数据库进行维护，包括内容和结构 但是数据库中的表要求有主键 且是自动增长字段-Able to carry out maintenance on the database, including the content and structure of the table but the database requires the primary key and is auto-growth fields

算法导论(中文版)，讲述了现代计算机常用数据结构和算法-this book intrdduce the basic algorithm,the language is chinese

邻接表，邻接矩阵的创建以及对它的一些操作等-Adjacency list, adjacency matrix, as well as the creation of some of its operations

这是一个用于计算最小生成树的程序。当人们逐个输入每条边的权，再点击生成，便能得到这个图的最小生成树。-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.

SHELL排序算法与应用-SHELL algorithm and application

pc游戏编程_人机博弈,算法和实现都比较完整，源码可运行。且可以从中学到很好的算法知识，和人机博弈-pc game programming _ man-machine game, algorithms and realization are relatively complete, source code can run. And can learn a good knowledge of algorithms, and human-computer game

员工工资单计算。