搜索资源列表
erchashu
- 建立一棵二叉树，要求分别用递归和非递归方法实现二叉树的先序、中序和后序遍历。-Create a binary tree, requiring respectively recursive and non recursive methods to achieve binary tree preorder, inorder and postorder traversal.
shu
- MFC写的二叉树小程序，输入后可以显示树，递归先序中序后序遍历和非递归中序遍历，数据结构相关-MFC binary write small programs can be displayed after the input tree, recursive sequence in the first post-order traversal order and non recursive inorder traversal, the data structure associated
erchashu
- 二叉树的遍历算法与实现，有前序 后序，中序的排列，分为递归算法和非递归算法的实现-Binary tree traversal algorithm and implementation of a pre-order after the order, the order of arrangement, is divided into a recursive algorithm and the realization of non-recursive algorithm
Application-of-the-tree
- 实现二叉树的后序遍历的非递归算法与设计。-After traversing the binary tree implementation of non-recursive algorithm and design.
Binary-tree-creation-and-traversal
- 二叉树的创建与遍历建立二叉树左右链存储结构。 对其递归的实现中序，先序，后序遍历。 对其非递归的实现中序，先序，后序遍历。 -Binary tree creation and traversal binary tree set up chain stores around the structure. Recursive implementation of its order, the first order, the order of traversal. Non-recursiv
binary-tree
- 1、参考P66建立二叉树的算法，建立图4-13（a）所示二叉树； 2、实现对该二叉树的先、中、后序遍历并输出遍历序列； 3、实现该二叉树的中序遍历非递归算法； 4、实现对该二叉树交换其左右子女的算法。 -1, reference P66 build binary tree algorithm, the establishment of Figure 4-13 (a) shows the binary tree 2, to achieve the binary
00123
- 非递归实现二叉树的后序遍历程序，希望随大家有帮助-The recursive realize binary tree after the order sequence, the hope of times with help
binary-tree
- 实现了二叉树递归先中后、以及非递归先中后序的遍历，运用模板是实现，可以很方便在以后使用-To realize the binomial tree recursion in first after the first, and recursion sequence of the traverse, after using the template is achieved, it is convenient to use in the future
xmlDecode_src
- 基于轻量级高效XML编解码，将树形数据结构用于最小化DOM模型XML编解码器的开发。在解析XML文本时,基于Expat解释器将XML字符串构造成树状结构 编码时构造DOM树结构,采用非递归深度优先法遍历树,将其串行化成XML串。本编解码器解决了国际化语言关键问题,是一个通用、高效的工业级XML应用支撑模块-Lightweight and efficient XML-based codec, the tree data structure used to minimize the DOM mode
BinaryTree
- 二叉树的前序遍历，中序遍历和后序遍历。使用了递归和非递归的方法-Pre-order binary tree traversal, inorder traversal and postorder traversal. The use of recursive and non recursive methods
Sort_Kind
- 对数据结构中二叉树的各种递归，非递归的排序，以及前序遍历，中序遍历，后续遍历。。等-Binary tree data structure for a variety of recursive, non-recursive sorting, as well as pre-order traversal, inorder traversal, the follow-up traversal. . Etc.
MyBiTree
- 完全二叉树的非递归前序遍历算法 一种比较好理解的方法-Complete binary tree pre-order traversal non-recursive algorithm is a relatively good understanding of the way
bittree
- 树的遍历，包括树的前序遍历后序遍历中序遍历的递归和非递归算法。-Tree traversal, including the pre-order traversal of the tree in order traversal post-order traversal non-recursive and recursive algorithms.
zuoye
- 二叉树的创建遍历，递归及非递归线索化等得实现-Create a binary tree traversal, recursive and non recursive clues and so have achieved
Traverse.doc
- 运用栈来实现树的先序中序后序的遍历非递归算法-preorder non- recursive algorithm , inorder non- recursive algorithm , postorder non- recursive algorithm
main
- 二叉树的建立、遍历 实现递归、非递归的遍历，前序、中序和后序都要求实现-The establishment of a binary tree, traversal recursion, non-recursive traversal, preorder, inorder and postorder are required to achieve
Nonrecursive
- 二叉树的先序中序后序遍历的非递归函数，都写在一个项目中，仅供大家参考-Binary tree s first order after sequence traverse sequence
BinaryTree
- 二叉树算法--C++描述。程序中包括了二叉树查找父结点、查找任意结点、创建、删除子树操作、递归（先序、中序、后序）遍历、非递归（先序、中序。后序）遍历、层次遍历。-Binary tree algorithm- C++ descr iption. Program includes a binary tree to find the parent node, any node to find, create, delete subtree operation, recursive (preorder
6.14Post-order-traversal
- 数据结构里，二叉树的后序遍历非递归算法。-Data structure, the binary tree postorder traversal non-recursive algorithm.
Data-structures-
- 分别采用递归和非递归方法，实现二叉树的链表存储实现的基本操作函数（包括二叉树的建立、释放、中序遍历、输出、测深度）。 -Using recursive and non recursive method, the basic operating functions (including the establishment of a binary tree, the release of the linked list storage implementation of the binary