InserSigList

PKU ONLINEJUDGE 2371

这是一个二叉树左右子树交换的简单程序，希望对大家有用！(This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!)

数据结构之队列，完整可运行的一个程序，包含队列的各种操作。(no)

说明：  该程序实现二叉树的遍历功能，能够打印出二叉树的节点(The program realization of the binary tree traversal function, is capable of printing out the binary tree node)

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

数据结构，利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)

队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)

A*算法通过启发式探索下一结点，逐步逼近目标结点，且使得路径最短。(A* algorithm heuristic to explore the next node, and gradually approaching the target node, and that the shortest path.)

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)

说明：  nuaa1108 多少连续的1 解题报告(Problem solving report )