搜索资源列表
erchashu
- 利用c#语言实现了二叉树的构造，并且同时实现了对二叉树的各种操作，例如二叉树排序，查找最大值或最小值。-C# computer language, using the binary tree structure, and simultaneous operation of all kinds of binary tree, such as binary tree sort, find the maximum or minimum value.
erchashu
- 二叉树 C++中的重点知识点-Binary Tree C++ in the key knowledge points
erchashu
- 二叉树的建立、显示、遍历（包含非递归及递归2种算法）-The establishment of a binary tree, display, traverse (including non-recursive and recursive algorithm 2)
erchashu
- 构建二叉树，实现很多功能-Build a binary tree
erchashu.c
- 对二叉树进行创建，寻找父节点，子节点，同时进行广度遍历-Create a binary tree to find the parent node, child nodes, while the breadth traversal
erchashu
- 设计程序实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数-Design procedures to achieve binary tree node type definitions and basic operation of the binary tree. The program includes a binary tree structure type, as well as each operation of the spec
erchashu
- 用vc++写二叉树排序算法程序实现简单的输入输出-Vc++ to write simple input and output binary tree sort algorithm
erchashu
- 该代码实现的主要功能是实现二叉树算法的运算-The code to achieve the main function is to achieve the Binary Tree Algorithm
erchashu
- 线索二叉树的应用，实现中序线索二叉树建立，实现自前向后和自后向前的递推遍历-typedef enum PointerTag
erchashu
- 数据结构课程设计，二叉平衡树实现学生管理系统，学生信息用文件保存，添加，删除，修改等操作。-Data structure curriculum design, binary balanced tree implementation student management system, students information is saved with the file, add, delete, modify, and other operations.
erchashu
- 实现二叉树的新建，树深度叶节点的计算，实现二叉树的遍历-Achieve new calculation of the depth of the leaf node in the tree, the binary tree binary tree traversal
erchashu
- 先序扩展序列建立二叉树,二叉树的先序,中序,后序遍历的递归与非递归算法,层序遍历,以及求树的深度.-First order expansion preorder, inorder, postorder traversal sequence to establish binary tree, binary tree recursive and non-recursive algorithm, the depth of the layer preorder traversal, as well as
erchashu
- 构建二叉树：输入二叉树的结点和前序、中序、后序遍历，结果输出一颗二叉树-er cha shu
erchashu
- 关于二叉树的综合实验，有创建、遍历、统计结点数、统计叶子数等操作。-Comprehensive experiments on binary tree, create, traverse, the operation of the statistics of the number of nodes, number of statistics leaves.
erchashu
- 使用c#完成数据结构里的二叉树，并使用中序遍历进行查找，适合初学者学习二叉树的使用-Use c# to complete the binary tree data structure, and to find the preorder, suitable for beginners to learn the use of a binary tree
erchashu
- 完成二叉树的深度优先非递归周游和广度优先周游-Complete binary tree non-recursive traversal depth-first and breadth-first traversal
erchashu
- 二叉树的基本操作,1. 建二叉树 2. 先序遍历 3. 中序遍历 4. 后序遍历 -The basic operation of the binary tree
erchashu
- 二叉树的创建以及应用，以及基于c语言的算法实现-Binary tree creation and applications, and the algorithm based on the c language
erchashu
- 用非递归的方式写出二叉检索树的构造以及插入和查找的算法-With a non-recursive way to write binary tree structure retrieval and insertion and search algorithms. .
erchashu
- 二叉树基本操作 先序，中序，后序遍历-Binary basic operation