按前序遍历序列创建二叉树，并中序遍历二叉树、求二叉树高度...

题目:稀疏矩阵是指那些多数元素为0的矩阵.利用稀疏特点进行存储和计算可以大大节省存储空间,提高计算效率.实现一个能进行稀疏矩阵基本运算的运算器.基本要求:以带行逻辑连接信息的3元组顺序表表示稀疏矩阵,实现两个矩阵相加,相减和相乘的运算.矩阵的输入形式采用3元组表示,而运算结果的矩阵则以通常的阵列形式列出.概要设计:1.以带行逻辑连接信息的3元组顺序表表示稀疏矩阵2.本程序包含2个模块:(1) 各集合定义模块(2) 主程序模块-topics : sparse matrix refers to those elements for most of the matrix 0. Using sparse features storage and computation can be greatly reduced storage space and improve computational efficiency. One can achieve for sparse matrix operations basic computing device. Basic requirements : OK logical connection with the three yuan Information Group the order said the sparse matrix table to achieve two matrices together, subtract and multiply arithmetic. Matrix entry forms using three yuan Group said, and the results of the matrix operations while the usual array listed. summary of design : 1. in line with the logic of information linking the three element group said sparse chronology matrix 2. this program contains two modules : (1) Set module (2) main program module

仿windows优化大师界面（源码）123456-imitation windows optimization master interface (OSS) 123456

PostgreSQL7.4.6 for Linux

描述：这个实验中需要实现的是拍卖系统的3个核心的类（Class Date, class Advertisement, and class Client） 目的： 1，使用C++的数据类型； 2，实现所有声明的函数； 3，使用预处理器实现包含。-Description：This assessment requires the creation of three of the core classes of the auction project. Class Date, class Advertisement, and class Client are three of the fundamental classes in the system. Outcomes: Students successfully completing this assignment would master the following outcomes. Use fundamental C++ data types Produce C++ class implementations given class declarations Use the preprocessor to perform file inclusion

ORACLE数据库的并集查询-ORACLE database inquiries and Set

这是数据结构中图的全部实现代码，对学习数据结构的同学很有帮助-this is a code of data structure

在学习堆栈的应用时，有一个很典型的例子，就是火车车厢的重排问题，该程序就是针对这个做了一个简单的MFC模拟程序-in learning the application stack, it is a very typical example is the train compartments, the rearrangement, The procedure is to address this and make a simple MFC simulation program

algorithm ， tree hash table, b tree, Tas de Fibonnaci-algorithm, tree hash table, b tree, Tas de Fibonnaci

高精度源程序，可进行任意长度的加减乘除模运算，本程序的大数用数组与表示数组长度一个结构表示-precision source, the length of the arbitrary arithmetic modulo operation, the majority of the procedures used with arrays of arrays length of a structure of

VC操作MYSQL的一些例子-VC operation MYSQL some examples