-
C++实现单向链表的基本操作，包括添加、删除、修改、遍历
本例主要是学习单向链表时的一个基础试验，当练手用，功能上包括链表的建立，节点的删除、修改、遍历。
- 2022-04-28 14:14:16下载
- 积分：1
-
树的建立算法和树的遍历操作。。。下载解压即可
树的建立算法和树的遍历操作。。。下载解压即可-The establishment of trees and tree traversal algorithm to operate. . . Download decompression can
- 2023-08-15 21:05:04下载
- 积分：1
-
A. General Queries
基于数据库设计一个网页,实现基本功能：增删改、查询、统计报表的功能要有.管理信息-A. General Queries- The system should be able to retrieve useful data stored in the database. B. Statistics Collection- The system should be able to generate useful statistics information. C. Modification of Data- The system should provide interface for the store managers to add, remove and update the data in the database. D. Dealing with special events in the system. Your system should be able to handle real life situations that may arise from running the business. E. You are required to implement a web user interface for your system. F. The user interface should be intuitive and effective to use. G. Please bear in mind that a casual user should not have problems to check some simple information. H. The system should provide an English UI. You can also design multi-lingual UI.
- 2022-12-15 03:20:03下载
- 积分：1
-
ado封装类
ado封装类-ado Packaging Category
- 2023-06-24 22:35:03下载
- 积分：1
-
pb 源码 进度条程序
pb 源码 进度条程序-progress of the process
- 2023-05-04 19:50:03下载
- 积分：1
-
关于找黑社会的数字
its about finding the Triad Numbers-its about finding the Triad Numbers...
- 2022-04-24 05:24:32下载
- 积分：1
-
2.[问题描述]
编写递归算法，在二叉树中求位于先序序列中第K个位置的结点
[输入]
按照先序序列的顺序输入该结点的内容。其输入abd eh...
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
- 2022-06-02 16:30:44下载
- 积分：1
-
algorithms and data structures, C
算法与数据结构,C语言版严蔚敏,清华大学出版社-algorithms and data structures, C-language version of Yan Wei Min, Qinghua University Press
- 2022-04-02 08:39:03下载
- 积分：1
-
实现二分法求解方程。编写并使用以下函数：
double SolveRoot(double(*pf)(double x),double a,double b,...
实现二分法求解方程。编写并使用以下函数：
double SolveRoot(double(*pf)(double x),double a,double b,int n)
这里，pf指向一个函数f，f用来定义要求解的方程f(x)=0，a和b是未知解x的上下界（即a
- 2022-05-10 10:45:06下载
- 积分：1
-
demonstration algorithm data structure
数据结构算法演示-demonstration algorithm data structure
- 2022-03-01 21:59:51下载
- 积分：1
