U盘Dos安装及引导文件（DOS+Grud供自制引导性U盘使用）

很多编程爱好者都编写过俄罗斯方块的游戏程序。很久以前，我用Tc2.0也做过一个；最近有好些朋友看见我以前的俄罗斯方块的程序后， 问我是怎么做的。我一直想把这个程序的整个过程写一份详细的东西，与各位编程爱好者分享，一直没空。正好现在放假了，而且离回家还有几天。于是我就把这个程序重新写了一遍，-Many programming enthusiasts have been prepared Tetris game procedures. A long time ago, I also made a Tc2.0 recently have some friends to see my previous procedure for the Russian box, the question is how I do. I have always wanted this process to write the whole process a detailed things to share with you programming enthusiasts, has been busy. Is now a holiday, and a few days away from home. So I put this process to re-write again,

一个用Dreamweaver制作的留言本，可以进行留言，是一个不错的留言本！-a production of the messages, voice mail can be a good message this!

双边带电路-Bilateral band circuit

VC中使用 Flash 美化你的程序-VC Flash beautify your procedures

基于P87LPC760的DALI从机-P87LPC760 based machine from the DALI

通过该程序可以计算前缀、中缀和后缀表达式的值。-Through the program can calculate the prefix, infix and postfix expressions value.

自己看看，JSP写的简单的聊天程序-Could see for himself, JSP write a simple chat program

gc:高级程序员考试用书的c程序源文件-gc : Senior Programmer examination with the source files c

本程序是用纯API函数写得一个小的贪食蛇游戏，可供初学者学习用-this program is written in pure API function of a small Tanshichi game for beginners to learn from

平衡二叉树操作的演示 一、 需求分析 （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