搜索资源列表
binaryTree
- 二叉树操作汇总，几乎设计所有算法，遍历递归、非递归、查找、求深度-Binary operation summary, almost all the design algorithm, recursive traversal non-recursive, search, and depth and so on
TreeTraversal
- 已知二叉树的先序、中序遍历的结果，构造出该二叉树，并用非递归的后序遍历算法遍历该二叉树-Sequence of the first known binary tree, traversal of the results of the binary tree structure, and after the use of non-recursive traversal of the binary tree traversal algorithm
binarytree
- 可以进行建立二叉树，递归先序、中序、后序遍历，非递归中序遍历等操作-build binary tree
Tree
- 非递归先序，中序及后序遍历二叉树. 根据二叉树广义表的字符串创建二叉树-First non-recursive sequence, and after the sequence of binary tree traversal
bianli
- 建立二叉树用非递归方法对树进行遍历，其中用到了栈来保存中间数据。-The establishment of tree with non-recursive method to traverse the tree, which uses a stack to save the intermediate data.
binarytreepaixu
- 本程序实现二叉树的操作，可以进行建立二叉树，递归先序、中序、后序遍历，非递归中序遍历等操作。-Binary tree of the program operation can be carried out to establish tree, recursive first order, in sequence, after the traversal of non-recursive traversal of the operation and so on.
shuju7
- 灵活运用非递归的遍历算法实现二叉树的其它各种运算；掌握按层次顺序遍历二叉树的方法；熟练掌握在中序线索二叉树上找给定结点的指定顺序下的前驱和后继的方法。-Flexibility in the use of non-recursive binary tree traversal algorithm to achieve a variety of other operations master-level order according to the method of binary tree tr
gezhongbianlisuanfa
- 各种二叉树的遍历算法，一共有9种，包括是先序遍历递归算法，非递归算法一，非递归算法二，同样后序，中序遍历也各有三种，很用心，都有注释，希望有所帮助-All kinds of binary tree traversal algorithm, a total of nine kinds, including the first recursive traversal algorithm, a non-recursive algorithms, non-recursive algorithm for
3.1
- 建立一棵二叉树，编写二叉树的前序遍历，中序遍历，后序遍历的递归算法与非递归算法-The establishment of a binary tree, the preparation of the first order binary tree traversal, in order traversal, postorder traversal of the recursive algorithm with non-recursive algorithm
TreeTraverse
- 二叉树的遍历操作，树结构用二叉链表存储，遍历时采用递归先序 中序 后序，层次遍历和非递归先序 中序 后序遍历-Binary tree traversal operations, binary tree structure list with storage, the use of recursive traversal sequence in the sequence after the first sequence, level and non-recursive traversal sequ
tree1
- 递归方式建立表达式树，并对表达式树进行递归和非递归两种方式的遍历，遍历方法分为先序、中序和后序，并对表达式树转为后缀表达式求值。-Established recursive expression tree, and the expression tree for recursive and non-recursive traversal of the two methods, divided into first traversal sequence, and after the sequenc
NON
- 实现二叉树三种遍历（先序遍历、中序遍历、后序遍历）的非递归算法。-The realization of the three binary tree traversal(PreOrderTraverse,In OrderTraverse,PostOrderTraversal)of the non-recursive algorithm.
search
- 树的遍历（非递归方式实现）：首先按中序方式建立树并输入节点信息，通过栈实现树的非递归方式的先序、中序和后序的遍历-Tree traversal (non-recursive way): First of all, by the way in order to establish the tree and enter the node information, the realization of the tree through the stack of the first non-recurs
qq
- 1.输入带空二叉树(信息)的先序遍历序列，生成一棵二叉树；(若结点为字符类型,用空格表示空二叉树；若结点为整数类型， 用0(零)表示空二叉树) 2.作前序遍历，分别用递归算法、非递归算法实现； 3.作中序遍历，分别用递归算法、非递归算法实现； 4.作后序遍历，用递归算法实现； 5.求度分别为0、1、2的结点的数目,分别用递归算法、非递归 算法实现； 6.按层次遍历二叉树(提示：使用一个队列实现）； 7.求二叉树的高度(深度)； -1. Enter
2
- 用C++实现二叉树的基本操作，包括对二叉树的删除，添加，递归和非递归的遍历等-Using C++ to achieve the basic operation of tree, including tree removal, adding, recursive and non-recursive traversal, etc.
satg
- 二叉树的建立和遍历c++语言非递归和递归实现-The establishment and traverse binary tree c++ language implementation of non-recursive and recursive
algorithm
- 非常实用的非递归二叉树遍历算法，可以解决许多生活中时机的问题-Very useful non-recursive binary tree traversal algorithm that can solve many problems in life time
bin-tree
- 二叉树三种遍历的非递归算法（背诵版), 学数据结构的朋友推荐看一看！-binary_tree
DataStructure
- 二叉查找树数据结构及基本操作，前序遍历，中序遍历，以及其非递归算法-Binary search tree data structure and basic operation, pre-order traversal, inorder traversal, as well as its non-recursive algorithm
Binary
- 二叉树的动态链表存储结构及表示，二叉树的三种遍历算法（递归和非递归两类）运用二叉树三种遍历的方法求解有关问题-Binary tree structure and the dynamics of linked list is stored, said three kinds of binary tree traversal algorithms (recursive and non-recursive types) the use of three kinds of binary tree tra