搜索资源列表
erchashu
- 数据结构实验：在一棵树中，用中序对其进行线索化-Experimental data structure: in a tree, inorder to its threaded
erchashu
- 假设自上而下按层次，自左至右输入每个结点的一个三元组(N, P, L/R)。其中N为本结点的元素，P为其夫结点，L指示N为P 的左孩子，R指示N为P的右孩子。试写一个建立二元树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。 -Assuming that the top-down hierarchy, from left to right input each node is a triple (N, P, L/R). N oriented junction element t
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
- VC++编程，实现二叉树的创建及遍历。北航软件技术基础作业。-VC++ programming, to create and traverse a binary tree.
erchashu
- 验证二叉树的二叉链表表示，实现CreateBiTree算法创建二叉树，实现二叉树的层次遍历算法，实现二叉树的先序、中序、后序递归遍历算法中的一种，编写主程序调用CreateBiTree创建二叉树，并调用二叉树的层次遍历、先（中、后）序遍历算法，测试不同的输入数据创建二叉树，预期输出并验证输出的结果。 -The binary list validation binary tree the preorder achieve CreateBiTree algorithms to create a
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语言源代码-A data structure on the binary sort tree implementation of the c language source code
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
erchashu
- 10个二叉树的基本算法(求宽度、深度、叶子节点、相等、相似等)-10 the basic binary tree algorithm
erchashu
- 这是关于二叉树的基本算法，包括二叉树的建立等-This is about the basic binary tree algorithm, including the establishment of tree, etc.
erchashu
- 递归算法的使用，练习小代码。挺实用，可以用来学习递归-The use of recursive algorithm, exercises little code. Very practical
erchashu
- 简单实现二叉树的建立，对二叉树进行排序，适合初学者-Simple to achieve the establishment of tree on binary tree sort, suitable for beginners
erchashu
- 1. 请中序线索化一棵二叉树。 2. 写出先序、中序、后序遍历一棵中序线索二叉树的算法。 3. 请实现后序线索化一棵二叉树。 4. 编写测试程序。 -1 Please inorder threaded a binary tree. (2) write first order, in sequence, after traversing a binary tree algorithm in order clues. 3.Please clues to achieve a p
erchashu
- 二叉树的遍历方法，有递归类型的，有非递归类型的-Binary tree traversal methods, there are recursive types, there are non-recursive types. . .