里面有很多有用的公式，很有利于算法的学习，希望与大家一起分享...

二叉树是重要的数据结构，在其它数据结构的学习当中是基础环节。其他树形结构与二叉树在本质上都有一定的相似。而遍历是树形结构的重要算法。好的遍历算法效率高稳定性强。C++实现的二叉树。

二叉树操作源代码，以及关键源代码的注解说明-Operation of the source code tree, as well as the key to the source code annotation Help

图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read

二叉树排序实现二叉树的前序、中序、后序排列，以菜单形式出现,代码简洁、易懂易用-Binary Tree Binary Tree Sort realize the first order, in sequence, after the sequence order to the menu form, the code is simple and easy to understand and use

从键盘上输 入一串正整数， 最后输入－1作为输入结束的标志。以这些正整数的值作为二叉排序树中的结点的数据场之值，建立一棵二叉排序树要实现排序二叉树的插入。采取叶子插入法，即新插入的节点均为改二叉树的叶子节点，且满足中序有序性。-From the keyboard to enter a string of positive integers, the last input-1 as the input end of the sign. These are integer values as binary sort tree nodes in the data field" s value, and the establishment of a binary sort tree to achieve binary tree insertion sort. To leaf insertion method, that the new nodes are inserted to change the binary tree leaf node, and in order to meet the orderliness.

数据结构 详细描述了如何链栈的方法以及操作-Data structure described in detail how the chain stack method and the operation of

汉诺塔代码,从第一个木桩中,把所有盘子从大到小搬移到第三个木桩中.-HANOR code from a wooden blocks, all the dishes to the smallest movement pickets were third.

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)

这是研究生课程计算方法与技术中讲到的UnionFind算法的具体实现代码。-This is the post-graduate courses and technical calculation method described in UnionFind algorithm to achieve the specific code.

数据结构编程源代码- Construction of data programming source code