搜索资源列表
Text6_2
- （1）分别采用递归和非递归算法建立二叉树； （2）采用先序、中序和后序三种方式遍历该二叉树； （3）按层次遍历该二叉树。 -(1) were used to establish the recursive and non-recursive algorithm for binary tree (2) using first-order, middle order and post-order traversal of the binary tree in three ways (
Realizationofthreekindsofbinarytreetraversal
- 二叉树的三种遍历（先序、中序、后序）算法用递归和非递归算法的实现-The three kinds of binary tree traversal (preorder, inorder, postorder) algorithm with the recursive and non-recursive Algorithm
java_tree
- 自己开发的可扩展java树结构，包括节点排序，遍历（非递归算法），查找（单节点，全路径匹配），添加删除等。排序方式，节点匹配方式均可通过接口可扩展，本代码是自己开发的一个cms项目中的一部分，可独立使用-Self-developed scalable java tree structure, including nodes sorting, traversal (non-recursive algorithm), find (single node, the full path to match
BiTree
- 分别采用先、中、后序分为递归和非递归两种方式遍历二叉树并输出结果-Were used before, during and after order is divided into two kinds of recursive and non-recursive binary tree traversal methods, and the output of
XMLparserforc
- 将树形数据结构用于最小化DOM 模型XML 编解码器的开发。在解析XML 文本时，基于Expat 解释器将XML 字符串构造成树 状结构；编码时构造DOM 树结构，采用非递归深度优先法遍历树，将其串行化成XML 串。本编解码器解决了国际化语言关键问题，是 一个通用、高效的工业级XML 应用支撑模块。-This paper designs a DOM liked tree data structure for developing a minimal DOM based eXtended
b_tree
- （1）建立二叉树的左右连存储结构 （2）能够对二叉树进行递归的与非递归的先、中、后根遍历 -(1) about the establishment of a binary tree with storage structure (2) can be recursive binary tree with non-recursive first, during, and after Traversal
5551
- 利用数据结构的知识生成一颗二叉树，利用非递归的算法遍历二叉树，主要借助栈来遍历二叉树-Data structures generated using a binary tree of knowledge, use of non-recursive binary tree traversal algorithm, the main stack to traverse binary tree with
erchashu
- 实现二叉树的非递归先序、中序、后序以及层序的遍历-Implementation of the computer science first order, in order, after the traversal sequence and the sequence
Cpp1
- 实现二叉树的创建以及对其进行非递归前序遍历，路径输出等功能-To achieve the creation of a binary tree and its non-recursive preorder traversal of the path output function
lab2
- 利用广义表建立的二叉树，将碱基作为他的节点，实现了以树形输出，并且交换了左右子树，利用非递归中序遍历和先序遍历。-The establishment of the binary tree using the generalized form, the base node as he realized to the output tree, and the exchange of left and right sub-tree in the use of non-recursive travers
Tree
- 一个有关二叉树的小程序，对二叉树的学习有用。利用非递归实现二叉树先序中序的遍历算法，程序中利用递归和交换函数实现了交换左右子树。-The binary tree is a small program useful for the study of the binary tree. Using the first order non-recursive binary tree traversal algorithm in the order the program and exchange the
BinaryTree
- 二叉树的建立，非递归前中后序遍历，判断二叉树的相似，实现二叉树中左右子树的交换-The establishment of a binary tree, taken in the order of non-recursive traversal of binary tree similar to the judge, to achieve a binary tree in the exchange of left and right subtree
tree
- 按先序遍历的扩展序列建立二叉树的存储结构 二叉树先序、中序、后序遍历的递归算法 二叉树中序遍历的非递归算法 二叉树层次遍历的非递归算法 求二叉树的深度(后序遍历) -By first traversing the expansion of the storage structure of binary sequences to establish the first order binary tree, in order, after traversing a binary
lab2
- 数据结构 二叉树的建立，前序中序，后续遍历，还有非递归算法-Bitree create
6.1
- 实现非递归二叉排序树的插入和创建,并用中序遍历检验-To achieve non-recursive binary tree insertion sort and create and use in order traversal test
binarytreedepth
- 求二叉树的深度、前中后序遍历的非递归算法-Seeking depth of binary tree, before, during and after traversing a non-recursive algorithm
bainlishubaogao
- 这是我们数据结构的实验，内容报告：分别采用递归和非递归算法建立二叉树；采用先序、中序和后序三种方式遍历该二叉树；按层次遍历该二叉树。 -This is the data structure of the experiment, the contents of the report: were used to establish the recursive and non recursive algorithm binary tree using the first order, the o
erchashu
- 中序遍历二叉树，实现递归和非递归的算法程序-zhongxu bianli erchashu
Binary_tree
- 二叉树大量算法的实现 实现了三种非递归不借助栈不修改结点结构的遍历算法。参考性非常强-Binary Tree Algorithm to achieve a large number of three non-recursive without the aid of the stack does not modify the node structure of the traversal algorithm. Reference is very strong
btree
- 用先序、中序、后序三种方式递归、非递归的遍历二叉树-With the first order, in order, the order of three ways recursive, non-recursive binary tree traversal