一个简易的ACCESS的源程序 VB源码

ssd7的本人的答案， 供大家参考, 希望大家喜欢-ssd7 exercise1

数据结构中的非波那起序列-data structure of the non-wave sequence since then

用C++写的寻找公共祖先，实现树的先序后序中序层次遍历，内有实验报告可以参阅。-C wrote for the public ancestors, the first realization of the tree sequence after sequence traversal sequence level, there are experimental report can be found.

下面是本人做的一个关于菜单的程序,其中对菜单的各种改变采用了重画技术.. -Below is the one I do on the menu of procedures, which on the menu to change the re-drawing of the technology ..

shi.c 说明:本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,对于空结点输入宏ENDTAG所对的值(暂定为整数0). 建立好二叉树后即可自动进行遍历依次层序输出各结点的值. ----Author:zhg 2006.11.26 E-mail: wudazhg@163.com 仅供参考学习之用，所有权保留-shi.c : The procedures for the binary tree traversal sequence. procedures at the beginning of each user input first-sequence binary tree nodes value, for the importation of empty node by right-ENDTAG value (tentatively scheduled for integer 0). After a good binary tree can be automatically traversal sequence followed output of the node values.---- Author : zhg 2006.11.26 E-mail : wudazhg@163.com for reference purposes only learning, retention of title

文章详细讲解分支限界的基本思想，单元最短路径问题，装载问题，0-1背包问题，旅游售货员问题等。-Detailed article on the basic idea of branch and bound, the shortest path problem unit, loading issues ,0-one knapsack problem, travel salesman problem.

学生成绩管理系统，实现以下功能，管理员可以增加删除学生，老师可以增删改学生的成绩，学生自己查询自己的成绩，学生可以修改自己的部分信息。

The Complete Book of Middleware

数据结构 详细描述了如何创建二叉树的方法以及操作-Data structure described in detail how to create a binary tree method and the operation of

数据结构的一些常用算法实现。单链表。无向图排序等-data structure of some commonly used algorithm. Single-Chain. No plans to sort etc.