2009年的行事历。繁体，有农历，简单，方便。

通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth- first traversal, the former sequence, sequence, after the preorder, the shape of the tree by tree print, the total number of nodes statistics, statistics leaf nodes, the nodes to the right statistics to calculate tree height, remove all leaf nodes, insert nodes, the nodes you delete nodes from the former preorder results and the results of Spanning Tree preorder, After the preorder from the results and the results preorder spanning tree, check whether the tree balanced and complete balance.

转换华为话务台话单.bll转为txt格式-Huawei attendant console conversion, then a single. Bll into txt format

该程序是完整的９８３４的测试程序，可以将这程序转变成Ｃ程序，直接可用-The program is a complete 9834 test procedures, these procedures can be transformed into C procedures directly available

矩阵的三角分解，ap指向a，bp指向下三角，cP指向上三角-Triangular matrix decomposition, ap point a, bp point lower triangular, cP point to upper triangular

又是一个俄罗斯方块的的源代码，不过这个更高级点。初学者不要看-is a Rubik"s cube of the source code, but the more advanced point. Beginners do not have to look

一个可综合的verilog描述的GPIO代码。-A GPIO design in verilog

虚拟光驱，linux系统下安装，rpm格式，非常实用的工具。-Virtual drive, linux system installed, rpm format, very useful tool.

树的遍历功能更仔细地说就是:树的主要四部份是根、干、枝、叶。树根一般在地下，在一棵树的底部有很多根。 　　在树干的部分分为五层。第一层是树皮。树皮是树干的表层，可以保护树身，并防止病害入侵。在树皮的下面是韧皮部。这一层纤维质组织把糖分从树叶运送下来。第三层是形成层。这一层十分薄，是树干的生长部分，所有其他细胞都是自此层而来。第四层是边材。这一层把水分从根部输送到树身各处，此层通常较心材浅色。第五层就是心材。心材是老了的边材，二者合称为木质部。树干绝大部分都是心材。 -it is OK it can run

Linux PNP-ISA 1.0规范,嵌入式的兄弟也许用得着-Linux PNP- ISA 1.0 norms, the brothers Embedded perhaps worthwhile

dos下虚拟光驱 -dos virtual drive