搜索资源列表
cBinaryTree
- 数据结构，二叉树的应用， 树的遍历，大部分是别人的， 只改了一下-data struct
29
- 在一棵中序线索二叉树中，实现后根中序线索二叉树的遍历；在构造二叉树时进行线索化。-ThreadBinaryTree
AVL_tree
- AVl树的遍历过程，C++编程，AVL树的各种算法-AVLtree
5235
- 本代码实现了数据结构二叉树的遍历转化 容易 易懂 -This code implements the traversal binary tree data structure is easy to understand conversion
BiTree
- 根据二叉树表的表示建立二叉树，实现二叉树的遍历，并给出从根结点到给定结点的路径信息。练习二叉树的链式存储及其遍历方法-According to the table that the establishment of a binary tree binary tree, binary tree traversal implementation, and give from the root node to a given node' s path information. Practice
BinaryTree
- 本程序实现二叉树的遍历，绝对原创。质量高！-A very good program .
binary
- 实现二叉树的遍历及应用。C++编写，运行速度较快。-Implementation and application of binary tree traversal. C++ is written to run faster.
BiTree_MFC
- C++ MFC,实现二叉树的遍历(前序、中序、后序)可自行添加节点-C++ MFC, to achieve the binary tree traversal (preorder, inorder, postorder) can add their own nodes
TreeTraverse
- 原创：C#实现数据结构的树的遍历 原创：C#实现数据结构的树的遍历-C# Traverse
tree
- 用C语言写的树的生成、树的遍历，并含有9种排序算法-Written in C language with the generation of trees, tree traversal, and contains nine kinds of sorting algorithms
bianlidir
- 递归遍历目录树（用递归算法遍历目录下的文件和文件夹）-Recursively traverse the directory tree (directory with a recursive algorithm traverse the files and folders)
circlelist
- 利用c语言实现二叉树的遍历,先序后序中序-Using c language binary tree traversal, the first order in the sequence after sequence
BinaryTree
- 利用数据结构，c语言，实现二叉树的遍历，递归非递归-Use of data structures, c language, to achieve binary tree traversal, recursive non-recursive
fwd3
- 利用C++语言，实现二叉树的遍历，前序中序后序，层序，递归非递归-Using C++ language, to achieve binary tree traversal, pre-order in the sequence after sequence, sequence, recursive non-recursive
CppApplication_10_2_1
- 利用c++，栈，队列的方法，解决二叉树的遍历，递归非递归-Using c++, stacks, queues, solutions to the binary tree traversal, recursive non-recursive
Tree
- 首先以广义表的形式输入一棵树，并且由程序建立，再依次实现对树的先序，中序，后序的遍历-preoder,inorder and postorder of a tree
AVLtreeopertion
- 一个AVL树的遍历算法程序,对于初学数据结构,C语言的人来说是个较好的例子-An AVL tree traversal algorithm program data structure for the beginner, C language of the people is a good example of
erchashu
- 二叉树的遍历二叉树的创建遍历中序前序后序-The creation of binary tree traversing a binary tree inorder traversal sequence after the pre-order
erchashu
- 系统应具备的功能： （1）建立二叉排序树； （2）中序遍历二叉排序树并输出排序结果； -System should have the function: (1) the establishment of binary sort tree (2) in the binary sort tree traversal and output sort the results
Tree
- 二叉树的遍历及显示，递归先序，递归中序遍历，递归后续遍历-Binary tree traversal and display