循环双链表和算术表达式

2-3树的数据结构以及演示程序-2-3 tree data structure and Demonstration Program

皇后算法111 很经典的 内含两种 希望大家喜欢-111 Queen"s algorithm includes the classic two hope you like

内部排序的所有算法，而且有相关可执行例子，包括插入排序，选择排序，希尔排序，快速排序，堆排序，归并排序等，很全，很孀。-sequencing of all internal algorithm, but is related to the executable examples, including insertion sort, select, in order of ranking Hill, the quick sort, heap sort, merging sequencing, all very, very widow.

关于教学管理的数据库-on teaching management database

在我的教室里，我学会了如何在 php 中使类。这就像在其他语言中的类。所以我分享我的课堂学习。

本程序详细 演示了 vc如何连接数据库，对学习mysql与vc++ 有很大帮助-This procedure demonstrated in detail how to connect vc database mysql and studying vc++ has a lot to help

C语言数据结构知识原代码 C语言数据结构知识原代码C语言数据结构知识原代码-C language data structure knowledge of the original code C language data structure knowledge of the original code C language data structure knowledge of the original code

数据库监视备份软件客户端通信软件广播状态参数 当前的主库(DWORD)+当前的状态(DWORD) -Database to monitor the backup software client software radio communication parameters the current state of the main library (DWORD)+ Current status (DWORD)

河南大学软件学院数据结构实验大纲    实验1至实验8

哈夫曼树算法 根据给定的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