建立二叉树

蜂群算法C语言实现，附带中文注释，简单易懂(ABC algorithm coded using C programming language)

开括号和比括号的匹配，数据结构内容，很不错(More than brackets and brackets to open the match, the contents of data structure)

高一凡数据结构答案，算法代码正确，齐全。(The answer is one where data structures, algorithms, code is correct and complete.)

VC游戏编写中的求解最短路径算法源码，本示例是自动寻径演示，篮点是起点，红点是终点，按确定键开始。源码爱好者注：编译后运行的时候请把EXE文件从Debug目录中拷贝到项目根目录中，若不然会出错。 (The preparation of the VC games to solve the shortest path algorithm source code, in this example is the automatic routing demonstration, the basket is the starting point, the red dot is the end point, press the OK button to start. Source enthusiasts Note: When compiled and run, please copy the EXE file from the Debug directory to the root directory of the project, and if not be wrong.)

说明：   问题描述：字符序列的子序列是指从给定字符序列中随意地（不一定连续）去掉若干个字符（可能一个也不去掉）后所形成的字符序列。令给定的字符序列X=“x0，x1，…，xm-1”，序列Y=“y0，y1，…，yk-1”是X的子序列，存在X的一个严格递增下标序列<i0，i1，…，ik-1>，使得对所有的j=0，1，…，k-1，有xij=yj。例如，X=“ABCBDAB”，Y=“BCDB”是X的一个子序列。 (Problem Description: character sequence is the sequence of a given sequence of characters from arbitrarily (not necessarily consecutive) to remove a number of characters (perhaps a not removed) after the formation of character sequence. So that a given character sequence X = &quot x0, x1, ..., xm-1&quot , the sequence Y = &quot y0, y1, ..., yk-1&quot is a sequence of X, X, there is a strictly increasing sequence subscript <i0，i1，…，ik-1> So for all j = 0,1, ..., k-1, with xij = yj. For example, X = &quot ABCBDAB&quot , Y = &quot BCDB&quot is a sequence of X.)

该书籍详细讲述了C语言的数据结构部分，不断提高你的编程能力。(This book describes the data structure of C language in detail, and constantly improves your programming ability.)

经典的0-1背包问题，程序可以自动输入并且有注释(Classical 0-1 knapsack problem, the program can automatically entered and annotated)

链表，输入一定的数据，通过链表进行储存，并排序后输出。(List。Input numbers,then output in order~~)

实现栈的基本操作，建栈，进栈，出栈，数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)

设计一个main函数，建立能够存放100个整型数据的顺序表对象，从自然数1开始找出80个能够同时被3和7整除的整数，依次存储到这个顺序表中，然后把其中个位数是偶数的数据输出来，并统计这种数据有多少。请把能够正确运行的main函数写在下面。(Design a main function, the table can be stored in the order of 100 integer data objects, from the natural number 1 to identify 80 can be an integer divisible by 3 and 7, in turn stored in the order table, then single digits outputs the data of the even number, and counts the number of such data. To be able to properly run the main function written below.)