本书是关于计算机科学与工程领域的基础性研究科目之一――数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树...

电力机车牵引变压器试验站总控程序，VB开发，Access数据库，通过串口与西门子200系列PLC通信-Electric locomotive traction transformer Experiment Station Master Control procedures, VB development, Access database, through the serial port and Siemens 200 series PLC Communication

在知道点的坐标或者数量和权重值时，选择最优的路径，这种有的是基于时间有的是基于运费等等，自动找两点路径最短距离！-Know the coordinates of points in the volume and weight or value, the choice of the optimal path, this time based on some because of some freight, etc., automatically find the shortest distance between two points in the path!

C#编写的OleDb数据库连接通用类库。-C# OleDb prepared by the General Class Database Connection.

数据结构。拉格朗日插值法算法。通过拉格朗日算法求方程-Data structure. Lagrange interpolation algorithm. Through the Lagrange method of Equation

数据结构的习题课课件-data structure Exercise Class Courseware

邻接矩阵求解最短路径（数组）.rar 邻接矩阵求解最短路径（数组）.rar-adjacency matrix for the Shortest Path (arrays). Rar adjacency matrix for the Shortest Path (arrays). Rar

数据结构。曲线拟合算法。通过曲线拟合法求曲线近似方程-Data structure. Curve fitting algorithm. Demand curve by curve fitting approximation equation

我写的数据结构小程序是关于排序算法的，功能比较全-I write the data structure of small programs algorithm, the entire comparison function

快照建立步骤及维护- The snapshot establishment step and maintains

2.[问题描述] 编写递归算法，在二叉树中求位于先序序列中第K个位置的结点 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g 。输入要求的位置 [输出] 若二叉树不空，按先序序列输出，求出所求位置的结点 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，先序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点并计算出二叉树中叶子结点的数目和第K个位置的结点 #include #include struct node{ char info struct node*llink,*rlink } typedef struct node NODE -2. [Description of the issue] to prepare recursive algorithm, Binary for the first sequence sequence in the first position of the K-node [imported] in accordance with the first order input sequence in the order of the nodes content. Input abd eh i g cf. Import requirements of the position [output] if the binary tree is not empty, the first sequence by sequence output obtained by seeking the location of nodes [storage structure] Table 2 forks storage [algorithm for the basic idea] recursive method and Traversing binary tree. First established binary tree root node, and then to build t