资源列表
Sort
- 数据结构中的内部排序，有很多排序方法，这在以后的软件系统开发上很有用-Sort of internal data structures, a lot of sorting method, which is useful in the future software system development
Traverse
- 树的遍历，数据结构必须掌握的算法之一，在很多系统中都需要用到它的思想，很重要-Tree traversal, data structures, algorithms one must master, in many systems need to use its ideology, it is important
campus-guide
- 校园导航或导游系统的实现，为游客提供本校的介绍与导航，方便有效-Campus Navigation
CPP
- C++绘图代码，绘制矩形，圆，三角形，直线，折线等较简单的平面图形-C++ drawing code to draw a rectangle, circle, triangle, straight lines, polylines, and other relatively simple plane figure
queen
- 队列，堆栈的源代码，已经经过测试，代码正确，只有简单的注释说明。 对学习数据结构的初学者对指针的理解有很大的帮助。-The source code of the queue, stack, has been tested, the code is correct, only simple notes. A great help for beginners to learn the data structure of pointers to understand.
Tree
- 对树的各种操作，包括二叉排序树，其中通过先序遍历和中序遍历构造二叉树，以及深度遍历，广度遍历，层度遍历，以及删除二叉排序树的某一个节点的操作。对学习数据结构有很大的帮助。-Various operations on the tree, including the binary sort tree, the first traversal and traversal construct a binary tree, as well as the depth of the traversal, br
Map
- 对图的各种操作，包括深度遍历，广度遍历，最小生成树，最短路径的各中算法，而且有递归和非递归方式，对学习数据结构有很大的帮助。 代码全是自己根据理解自己写的，思路很符合初学者。-Various operations on the map, including the traverse depth, breadth traversal, minimum spanning tree, shortest path in the algorithm, and recursive and non rec
SortMethod
- 数据结构的各种排序算法，包括同一种算法的递归和非递归方式，对学习数据结构有很大作用。-Data structures of various sorting algorithms, recursive and non-recursive way, the same algorithm on the learning data structures.
linklist
- 链表的倒序创建，删除指定的数字和输出链表等。-The reverse of the list to create, delete specified number and output linked list.
BinSearchNode
- 构建二叉树，二叉树的先序，中序，后序的遍历以及排序，删除等。-Build a binary tree, binary tree preorder, inorder, postorder traversal and sort, delete, and so on.
bintree
- 构造二叉树，对二叉树进行先序，中序，后序等三个遍历，自己先构造一颗二叉树，然后再进行输入。-Construct a binary tree, binary tree traversal of the first sequence, order, order three, first construct a binary tree, and then enter.
Graphs_4
- 数据结构 无向图的邻接表 并按深度优先搜索结点-The data structure press the depth-first search node to the adjacency table