搜索资源列表
tree
- 简单的java 实现树结构，递归遍历子节点-The realization of a simple tree structure java
oulalujingbianli
- 通过欧拉路径计算非叶子节点的后代数目，并且先序遍历输出构造的二叉树-Eulerian path through the calculation of non-leaf node the number of generations, and output first traversal of the binary tree structure
652
- 中序遍历线索二叉树，可实现二叉树的建立，遍历以及对前去后继的查找
tree
- 所谓遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 -The so-called ergodic (Traversal) refers to a search along the line, followed on each node in the tree are done once and only one visit. Access node operation done depends on the
Polynomialexpressionandcomputing
- 所谓遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 -The so-called ergodic (Traversal) refers to a search along the line, followed on each node in the tree are done once and only one visit. Access node operation done depends on the
visitbinarytree
- 实现了向计算机输入一颗二叉树，并可以输出他的各种遍历结果-Input to the computer realization of a binary tree, and can output the results of his various traversal
binarytree
- 已知二叉树的任意两种遍历序列，可以得到树的第三种遍历序列。如已知先序和后序序列，输出中序序列。-Known binary tree traversal of any two sequences, can be the third tree traversal sequence. If known after the first sequence and the sequence sequence sequence sequence output.
traverse
- 输入一个二叉树的前序和中序遍历，程序给出此二叉树的后续遍历。-Input a preorder traversal and a midorder traversal of a binary tree.The program will show the after traversal of the binary tree.
tree
- 实现树的各种遍历，希望对你有用-To achieve a variety of tree traversal, I hope useful for you! ! ! ! ! ! ! ! !
BiTree
- 有关二叉树的存储结构和遍历，说明详细，代码清楚，很好的选择-Storage of the BiTree structure and the traversal
tree
- 对一建立的二叉树进行先序遍历、中序遍历、后序遍历、层次遍历并输出结果-The establishment of a first sequence to the binary tree traversal, in order traversal, postorder traversal, traversal and output levels
recursivealgorithm
- 医院结构的树的实现，其中用到的是map容器。递归计算了医院的某个部件含有的子部件的个数，遍历计算-Hospitals to achieve the structure of the tree, which is used in the container map. Recursive calculation of the hospital containing components of a number of sub-components, traversing the calculation
Tree
- 采用递归算法实现二叉树的建立，以及三种遍历方法实现-Recursive algorithm using binary tree establishment, as well as the three traversal methods
qq
- 1.输入带空二叉树(信息)的先序遍历序列，生成一棵二叉树；(若结点为字符类型,用空格表示空二叉树；若结点为整数类型， 用0(零)表示空二叉树) 2.作前序遍历，分别用递归算法、非递归算法实现； 3.作中序遍历，分别用递归算法、非递归算法实现； 4.作后序遍历，用递归算法实现； 5.求度分别为0、1、2的结点的数目,分别用递归算法、非递归 算法实现； 6.按层次遍历二叉树(提示：使用一个队列实现）； 7.求二叉树的高度(深度)； -1. Enter
BitTree
- 二叉树的基本操作和层次遍历，很简单的数据结构的代码。-The basic binary tree traversal operation and level, the data structure is very simple code.
@Cmy_Binary_Tree_template
- 一个基于排序二叉树的模版，用来巩固二叉树的基本算法--前序、后序、中序遍历等。-A binary tree based on the sort of template for the consolidation of the basic binary tree algorithm- pre-order, after the sequence, and so on in order traversal.
RecursionOfTree
- 这个是关于迭代技术实现的文档，是关于二差遍历树的通用递归实现的设计-recursion
BinaryTree
- 二叉树的创建以及先序、中序、后序和层序遍历-welcome
FigureandTree
- 数据结构：最小生成树拓扑排序图的邻接表及遍历关键路径二叉树遍历-Data structures: minimum spanning tree topology of the adjacent table to sort and map the critical path traversal binary tree traversal
Maptheepthoftraversal
- 数据结构对二叉树的深度遍历用进栈，出栈的方法。-The depth of the binary tree data structure traversal to use into the stack, a stack method.