2

数据结构相关代码，源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)

道格拉斯—普克法(Douglas—Peucker)的C++程序(Douglas- Puck method (Douglas-Peucker) of the C++ program)

组合数学全排列,包含有六种全排列的方法，字典序法(math of permutations)

数组的定义与使用，数组的运算，字符串的输入与输出，冒泡排序(list and array)

数据结构基础内容，两栈共享空间，参考《大话数据结构》(Structural basis of data content, two stacks shared space, refer to Westward data structure )

航迹起始中的逻辑航迹起始算法源代码，本代码具有很好的航迹起始效果！ (Track initiation logic for track initiation algorithm source code, this code has the effect of track initiation)

Devil language 数据结构中的经典问题 此为问题!(Devil language data structure of the classic problems of this problem!)

编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。 （其中随机生成点和边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )