图书馆系统

建立并按前,中,后序方法遍历二叉树,本代码用的是非递归方法,递归方法的稍后给出-established as before, during and after the binary tree traversal sequence method, the code of non- recursive method, recursive method is later

数据库VFP编程模块-Database Programming Module

一个简单的网络爬虫，使用SQL sever数据库 给初学者参考-err

  SQLite是一个开源的跨平台的轻型数据库，WINCE本身也有一个自带的数据库SQLCE ，但占用的资源会比较大。最近项目中考虑用到 SQLite，因此特别研究了一下，下面介绍一下具体的移植方法。   去SQLite官网http://www.sqlite.org/download.htm下载最新的source code。我下载的是sqlite-amalgamation-3071401.zip。解压后会得得到四个文件（shell.c、s

1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下： #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af

用C++实现的工资管理系统!这里用了数据结构中的链表!-Using C++ implementation of the salary management system! Here with a list data structure!

能够连接各种数据库的API-to connect to various databases API

一个功能强大的栈，用法很灵活，你会发现很有趣- A function formidable stack, the usage is very flexible, you can discover very interesting

企业库存管理系统

这里采用了C++里随机的一个函数,通过修改,顺利变成一个在指定范围内随机抽取数据的函数,并且不重复抽取-here C. Lane used a random function, through the revision, smoothly into a designated area in random data function, and does not take repeat