xianduan

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)

数据结构 银行模拟问题 (Bank of simulation data structure problem)

说明：  线性链表的定义，遍历，查找，删除，排序。(Linear list definition, traversal, search, delete, sort.)

一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)

c语言编写链式线性表的初始化，创建，插入删除等操作。(c language chained linear table is initialized, create, insert and delete operations.)

二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表(Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list)

图的遍历问题 数据结构 C C++ 源码 课程设计 严蔚敏版的书(yrteryryer)

先序创建二叉树，将二叉树所有节点的左右子树交换，再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)

说明：  约瑟夫算法，适合初步学习数据结构的同学了解递归调用的特点(josephus in C language)