red-tree

说明：  标准答案习题1 1.1 简述C++语言程序的结构特点。 答： （1）C++程序由一个或多个函数组成，其中至少有一个主函数main()，程序从主函数开始执行，由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)

校园导航系统包含佛山科技学院本部校区的校园景点平面图。通过系统的各功能不仅可以查询任意景点的编号，名称，简介等信息，还可以查询任意两景点间的最短路径及长度和所有路径及长度。另外，还可以通过一系列操作增加，更改或删除任意的景点的各信息。(Contains the campus attractions plan of the campus Foshan Institute of Technology campus navigation system. Through the function of the system not only can query any spots number, name, profile and other information, can also query the shortest path and arbitrary length between two spots and all paths and the length of. In addition, can also increase through a series of operations, the information change or delete any of the attractions.)

在VC中实现Bresenham算法画直线(Bresenham algorithm in VC draw a straight line)

二叉树的建立 中序遍历二叉树 把二叉树转换成双向链表(Binary tree in the establishment of traversing Binary conversion to binary tree into a doubly linked list)

Huffman编码与译码，实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)

数据结构 堆栈 实现了以下功能： cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)

多项式相加的数据结构试验·············(Polynomial sum test data structure)

二叉树排序，二叉树的递归调用排序，属于C语言源码(Binary Tree Sort)

利用串来比较数据大小，代码中有两个串，通过串来比较大小( 10/5000 Use the string to compare the data size)

程序可以实现哈弗曼自动编码功能！很详细的！很有参考价值！(Program can be Havermann automatic coding features! Very detailed! A good reference!)