红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃def...

狮身人面像单位；

附所有源码和控件 MovingChar.ocx 循环移动的字幕 as97Popup.ocx 按钮 其中有使用data控件和数据环境设计器打开有密码的数据库的方法。-all MovingChar.ocx cycle and control the movement of subtitles as97Popup.ocx button which controls the use of data and data environment designed to open a password database approach.

ORACLE数据库得建表语句-ORACLE database built in Table statement

请假销假的管理系统-leave posture of the management system

本代码经过验证，绝对可以运行，并附有解析，对初学者有很大帮助-Verified the code and it can definitely run with a resolution, has great help for beginners

功能: 1.添加单个成绩 2.批量添加成绩 3.通过搜索并修改与删除 4.直接修改 5.可以批量删除 6.可以直接GO到达你想到达的页-functions : 1. Add two individual achievements. Batch added three results. Search and amended with the deletion of four. 5 directly alter. Volume 6 can be deleted. GO can reach you directly to the arrival of page

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

能够输入节点 然后完成图的广度优先遍历-Able to enter the node and then complete the graph breadth-first traversal

建立快速傅利叶变换 C 语言源代码 17K-establish Fast Fourier Transform C language source code 24K

pb9开发的万能查询源码，相当好用-pb9 development of the omnipotent source inquiries, very handy.