地址管理VB6

嗨，这个项目基本上是帮你在网上订公共汽车票。它包含javascript和php/mysql函数。小心，这将证明基本上对任何人都有用。尽情享受吧！干杯；

能够在数据库中存取大的二进制块-to access large databases of binary block

该程序在于如何进行图片存取,怎样访问EXCEL表格.-the program is how to access pictures, how to visit Excel.

求最短路径问题,传给大家看看,希望能对大家在实用中有点帮助-seek the shortest path problem, we look at the pass, we hope to the right a little practical help

TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves. we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check its leaves i n terms of algorithm as preorder. midorder or postorder.

ORACLE 数据备份,实现oracel数据库的正提，表，记录的分别备份,功能强大，操作方便，可以放心使用，

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t

严蔚敏编写的《数据结构》第2章的答案，全部为源码-the answers of chapter two of a book called ‘Data Structures’ writen by Yan Wei Min

Prim算法（节点可任意选定） Prim算法（节点可任意选定）-prim algorithm

一个有关于VC6.0与ACCESS数据库结合的小程序-An ACCESS database on VC6.0 and the combination of small programs