第4章

数据结构 实验练习 删除相同的节点 希望会对大家有所帮助(Data structures lab exercises to remove the same node want to be helpful to everyone)

上海交通大学数据结构课程的课后作业系列3.5：仅供参考，最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)

数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

字符串，实现了文件中查找想要的字符串，并将其标记出来

流水线车间的零件加工排序问题，以达到最优的加工顺序，使加工时间最短或零件后期维护费用最少(Plant parts processing pipeline scheduling problem, in order to achieve optimal machining sequence, so that the processing time of the shortest or least parts later maintenance costs)

按照一定的输入求出二叉树的层次遍历，输出相应的结果(Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results)

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

二叉树排序，二叉树的递归调用排序，属于C语言源码(Binary Tree Sort)

哈夫曼编码程序，实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)

实现回溯算法，能解决八皇后问题等～～算法结果优化，时间复杂度较小(Implement backtracking algorithms can solve the eight queens problem, etc. ~ ~)