11组表达式求值

二叉搜索树的生成和查找节点，北大《数据结构与算法》教材的习题(The generation and find nodes of a binary search tree, Peking University, " Data Structures and Algorithms" textbook exercises)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

mfc 连接数据库 用mfc做的管理系统，戏中包括数据库连接(mfc connect to the database)

魔方问题 数据结构 使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)

设计、编写和调试面向对象C++程序，实现任意两个同类数据比大小 的通用函数（模板），涵盖普通数值型数据之间的比较、两个字符串之间的比较 （按字典序）、两个复数之间的比较（按模大小）等，并通过主函数加以调用和 测试。(Design, writing and debugging of object-oriented C++ procedures to achieve similar data than the size of any two generic functions (template), covering general comparison between numerical data, the comparison between the two strings (lexicographically), two Comparison between complex numbers (modulo the size), and through the main function to be invoked and tested.)

参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目，项目编号分别为 和 。由于各项目参加人数差别较大，有些项目取前五名，得分顺序为7，5，3，2，1；还有些项目只取前三名，得分顺序为5，3，2。写一个统计程序产生各种成绩单和得分报表。 2、要求产生各学校的成绩单，内容包括各校所取得的每项成绩的项目号、名次（成绩）、姓名和得分；产生团体总分报表，内容包括校号、男子团体总分、女子团体总分和团体总分。 3、测试数据：对于 ， ， ，编号为奇数的项目取前五名，编号为偶数的项目取前三名，设计一组实例数据。 (The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report , content including the school number , male person group total points , woman group total points and group total points. 3, testing data: Be that the odd number project chooses the first five to the serial number, the serial number is that the even number project c)

说明：  数据结构基本算法实现。包括栈、二叉树基本运算实现，同时包含整数计算器的完整实现。(The basic algorithm data structure. Including implementation of stack, binary tree basic operations, and a complete implementation of an integer calculator.)

/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边， *基准值为一组，这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high，即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)

给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)