搜索资源列表
ruanjianjishu
- 1.采用递归方法建立二叉树； 2.给出三种遍历序列； -1. Recursive Methods using binary tree 2. Gives the three traversal sequence
Binary-Tree-levorder
- 用C++实现二叉树中的层次遍历（Binary_tree.cpp中），levorder，用的是队列-Use C++ achieve the the hierarchical traversal (Binary_tree.cpp) binary tree, levorder, the queue
Binary-Tree
- 实现了二叉树的四种遍历算法，先序遍历，中序遍历，后序遍历，层次遍历，另带有Word文档，其中有程序示例图-Achieved four binary tree traversal algorithm, the first traversal, inorder traversal, postorder traversal, level walk, and the other with a Word document, including procedures for sample map
erchashu
- 二叉树的建立，先序、中序、后序、层序遍历（递归和非递归方法），二叉树的高度、繁茂度，交换左右子树，统计叶子节点的数目，判断是否为完全二叉树，按树的形态在屏幕上打印输出；-failed to translate
Tree
- 非递归建立已知先序与中序遍历结果的二叉树-Non-recursive first order and the establishment of the known results of the binary tree traversal
traversing-binary-tree
- 非递归遍历二叉树Non - recursive traversing binary tree Non - recursive traversing binary tree Non - recursive traversing binary tree -Non- recursive traversing binary tree
bin_tree
- 自己数据结构试验课写的二叉树的遍历，简单实用,可以用一用-C program to solve bin_tree
BinaryTreeViaMFC
- 画图法实验数据结构中二叉树先序、中序、后序遍历和显示。-Paint Method in the first order binary tree data structure, in order, post order traversal and display.
erchashu
- 建立一棵二叉树，要求分别用递归和非递归方法实现二叉树的先序、中序和后序遍历。-Create a binary tree, requiring respectively recursive and non recursive methods to achieve binary tree preorder, inorder and postorder traversal.
20110529
- 二叉树的基本功能，包括先序、中序、后续遍历，二叉树的深度，长度等。-The basic functions of a binary tree, including the first order, in order, follow-up traversal, binary tree of depth, length.
bitree
- 二叉树的遍历,才用四种遍历方式，前，中，后，层次遍历-bitree search
binary-tree
- 1) 用先序递归过程建立二叉树（存储结构：二叉链表） 输入数据按先序遍历所得序列输入，当某节点左子树或右子树为空时，输入‘*’号，如输入abc**d**e** 2) 编写递归算法，计算二叉树中叶子结点的数目。 3）按凹入表方式输出该二叉树。 -1) The process established by the first order recursive binary tree (memory structure: binary list) input data sequen
shu_bianli
- 该程序实在mfc下实现二叉树的遍历（数据结构知识），一方面涉及数据结构知识，另一方面涉及mfc知识，功能较全。-The program is to achieve binary tree traversal mfc (data structure knowledge), on the one hand knowledge of data structures involved, the other involving mfc knowledge, capabilities than the wh
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
BiTree
- 实现以二叉链表存储二叉树，以先序遍历的方式构造二叉树，并输出先序，中序，后序遍历结果-Binary list stored in the realization of a binary tree to be the first way of traversing a binary tree structure, and outputs the first order, in sequence, the result after traversing
Application-of-the-tree
- 实现二叉树的后序遍历的非递归算法与设计。-After traversing the binary tree implementation of non-recursive algorithm and design.
erchashu
- 数据结构中二叉树的遍历，对二叉树进行先序，中序，后序遍历，其中要用到循环查找-Traversing the binary tree data structure, the first sequence of binary tree, in order, post-order traversal, which use to find circular
37116txt
- 任务： 要求能够输入树的各个结点，并能够输出用不同方法遍历的遍历序列；分别建立建立二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数； -Whereas it is essential, if man is not to be compelled to have recourse, as a last resort, to rebellion against tyranny and oppression, that human rights should b
Btree
- 二叉树的插入删除先后中序遍历及求宽度和深度-Binary tree insertion and deletion has in traversing the width and depth requirements