使用pb备份sqlserver数据库-use SQLServer database backup pb

实用的java习题,初学者可用-Java practical exercises, beginners can be used

看看，有没有你要找的程序，这是一个强大的C语言集，里面可能有你要找的某个程序-see, you have to find the procedure, which is a powerful set of C language, you probably have to find a certain procedure

用于串口调试,用于主机与各模块之间的通讯,使用很方便-For serial debugging for the host with the communication between modules, use the very convenient

JAVA的例子程序，很适合初学的人，相信有很大帮助的．-JAVA examples procedures, are very suitable for the beginner, I believe very helpful.

用Huffman编码完成的文件压缩与解压-Huffman coding used to complete the document compression and decompression

关于uboot的移植及命令的一些介绍,查作为移植使用的参考-on uboot transplant and ordered to definitely check the use of transplantation as a reference

滤波电路设计软件-filter circuit design software

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins

二叉树后序遍历8_3.rar c加加课程设计-Binary tree postorder 8_3.rar c Gaga Course Design