keshe

说明：  但是对于“真二叉树”（每个内部节点都有两个孩子的二叉树），给定它的先序、后序遍历序列足以完全确定它的结构。将二叉树的n个节点用[1, n]内的整数进行编号，输入一棵真二叉树的先序、后序遍历序列，请输出它的中序遍历序列。(But for one proper binary tree, in which each internal node has two sons, we can uniquely determine it through its given preorder traversal sequence and postorder traversal sequence.Label n nodes in one binary tree using the integers in [1, n], we would like to output the inorder traversal sequence of a binary tree through its preorder and postorder traversal sequence.)

It s email spammer, I often use it to attack back spam mail

MFC中的TAB控件实例编程，带TAB图标(The TAB control instance in the MFC programming with TAB ICONS)

输入提示，vc6.0环境下实现输入框内容提示(Enter the prompt, vc6.0 environment realize the contents of input box prompt)

3D8光立方，动画程序！可供下载，几十种动画！(3D8 cube, animation program!Available for download, dozens of animation!)

本程序是在Visual C++的环境下实现的使用ADO对象向数据库中添加数据，可以更新数据库(This program is in Visual C++ environment to achieve the use of ADO object to add data to the database, you can update the database)

程序对48个城市的TSP问题（城市坐标文件对应于48.txt）进行计算，求解路径和最优路径图如下。 48个城市结果，大的红*表示路径开始城市，途经城市依次用蓝色方块和红色*标示。 (Procedures of the 48 cities TSP problem (document coordinates corresponding to the city 48.txt) to calculate the optimal solution of the path and road map are as follows. The results of 48 cities, the path of the red* indicates the beginning of the city, passing through the city followed by the blue box and red* marked.)

QT学习教程，很好用的 差不多所有的程序教材都从Hello 开始，下面就是这个程序的qt版本(good QT course 1#include <QApplication> 2#include <QLabel> 3 int main(int argc, char*argv[]) 4 { 5 QApplication app(argc, argv) 6 QLabel*label = new QLabel("Hello Qt!") 7 label->show() 8 return app.exec() 9 } )

说明：  DirectDraw编程方法与技巧.pdf(DirectDraw programming methods and techniques. Pdf)

关于MFC中ADO数据库的学习，很基础的例程可供下载学习(Learn about the MFC ADO , it is the foundation of learning routines available for download)