2元树的先根遍历算法，中根遍历算法，后根遍历算法

C++面试试题，值得一看-C interview questions, the eye-catcher

一个不错的数据源连接程序-a good source of data link procedures

表达式求值：支持浮点运算，以及一些纠错功能-expression evaluates : support floating-point operations, and some correction function

利用回溯算法求解n皇后问题；并通过本例熟悉回溯算法在程序设计中的应用方法。-The use of backtracking algorithm to solve n queens problem and are familiar with the passage of the cases of backtracking algorithm in the program design should be applied.

数据结构的课后练习-Data structure of the after-school practice

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

利用Excel进行读写操作，很方便，很实用，可以试一试-Use Excel to read and write operation, it is convenient and very practical, you can try

一个很好的考勤管理系统-a good Attendance Management System

数据库课程设计要求-database design courses

hash排序，用hash法进行字符或数字的排序。-hash