Shi Bole @ beige book Data Structure Course part1

根据一棵二叉树结点的先根序列和中根序列构造该二叉树，并输出该二叉树的后序遍历结果。-According to a binary tree the root node of the first sequence and the sequence structure of the tree root and post the output of the binary tree traversal results.

银行家算法！这是一各比较简单的银行家算法，是在c 语言的环境下开发的！-Banker

(一) 编写一个程序LAGO7-1.CPP，实现二叉树的各种运算，并在此基础上设计一个主程序完成如下功能。 （1） 输出二叉树B； （2） 输出二叉树B的深度； （3） 输出H结点的左、右孩子结点值； （4） 输出二叉树B的宽度； （5） 输出二叉树B的结点个数； 输出二叉树B的叶子结点个数 -(A) to prepare a program LAGO7-1.CPP, to achieve a variety of binary operations, and on this basis, design a main program performs the following functions. (1) output binary tree B (2) The output of a binary tree B of depth (3) The output of H nodes left and right child node value (4) outputs a binary tree B, width (5) output node B, the number of binary trees (6) outputs a binary tree B, the number of leaf nodes

-

对文件中的数据进行哈夫曼编码和解码,列出给定数据的权重,列出左右孩子和父亲节点的列表,对任意数据进行进行哈夫曼编码和解码-to document the data Huffman coding and decoding, data presents given weight, shown around children and the father node list of arbitrary data for Huffman coding and decoding

倒置一个单链表，链表是带有头结点的单链表，通过不断在表头插入结点，使链表有序-Inversion of a single linked list, linked list is the first node with a single list, through constant head inserted in the table node, so that an orderly list

用Eclipse里面的SWT控件对连接数据库的实现 -Using Eclipse

欢迎到分钟报警 VB6 实用程序，用于...时间在几分钟内在第一个文本框中输入。

程序功能： 实现一元多项式的四则运算 ，用到的主要就是多现式的实现，除法实现起来是很复杂的。-procedures functions : achieving a polynomial of four operations is mainly used in the more- is the realization Apart from achieving up is very complex.

实现了临时建立分区和永久建立分区的效果 可以压缩和解压缩的解压缩文件-achieve the establishment of the provisional district and the establishment of a permanent regional results can be compression of the extracted files