搜索资源列表
fei-digui-tree
- 利用非递归的方式对一个二叉树进行操作 比如先序中序后序遍历-Use of non-recursive way to operate on a binary tree such as the first post-order traversal sequence in order
digui-binary-tree
- 利用递归的方式对一个二叉树进行操作 比如先序中序后序遍历-Recursive way to operate on a binary tree such as the first post-order traversal sequence in order
tree
- 用数据结构实现数据的查找，用二叉树的方法实现数据的遍历-Data with the search data structure, method of binary tree traversal data
BitTree
- 具体功能函数有：建立二叉树、删除二叉树、前中后层序遍历-Specific functions of functions are: to establish tree, remove the binary tree, traversal sequence before, during, after
BST
- 编写生成二叉树,可以实现二叉树的生成、增加、删除、遍历-Write generate binary tree, binary tree can generate, add, delete, traverse
shujujiegoua
- 数据结构里面基本所有的知识点的代码为全班同学的作业如约瑟夫问题、哈弗曼编码、层次二叉树、深度广度遍历-Data structure inside knowledge of the basic points of all the code for the whole class of operations such as Josephus problem, Ha Fuman coding, hierarchical binary tree, depth, breadth traversal
boot
- 可实现二叉树的建立 手动输入 三种遍历 前序 后序 中序遍历-The establishment of a binary tree can be achieved manually, after the three pre-order traversal order of traversal
traversal-of-binary-tree
- 二叉树的三种遍历的C#实现 能够在.net环境下执行-binary tree traversal traversal of binary tree
binarytree
- 二叉树给出前序中序遍历结果或后序中序遍历结果恢复二叉树并显示-Binary tree gives the order before or after the results in the traversal sequence in the binary tree traversal and display the results of recovery
BiTree
- 二叉树的基本操作 包括建立 遍历的递归非递归的数据结构-Including the establishment of the basic operation of a binary tree traversal non-recursive recursive data structures
Tree
- 二叉树的遍历及显示，递归先序，递归中序遍历，递归后续遍历-Binary tree traversal and display
Rebuild-binary-tree
- Rebuild binary tree 根据输入的二叉树前序和中序遍历序列重构二叉树，输出对应节点的左右子节点。-Rebuild binary tree
binary-tree
- 二叉树的建立与遍历，非常适合初学者，纯属个人出品，-The establishment and traverse binary tree, very suitable for beginners, produced purely personal,
erchashushixian
- 通过二叉树的链接表示方法在二叉树类中添加成员函数用于实现二叉树的构建，删除和求二叉树的节点个数的运算，二叉树先序中序后序遍历的运算还有二叉树的复制运算以及求二叉树中叶子节点个数的运算。-Binary color to achieve a link through the binary tree representation in the binary tree class by adding member functions used to implement the construction
ex3
- 二叉树的建立和遍历 先序，中序，后序 中序非递归 界面实现-The establishment of a binary tree and traverse the first order, in order, after the sequence in order to achieve non-recursive interface
tree
- 实现了一个简单的二叉树的创建与遍历，包括前序，中序与后序，大家可以参考一下-Implements a simple binary tree creation and traversal
datastruct_tree
- 本程序是用MFCA实现的二叉树的前序中序后序递归遍历，中序非递归遍历的实现，-binary tree
BTree3_src_vc6
- 这是一个VC++根据前序序列和中序序列生成二叉树的程序，并进行遍历。 很不错的参考程序。 -This is a VC++ according to the preamble sequence and the sequence binary sequence generation process, and to traverse. Very good reference program.
BTree3_src_vc6
- 这是一个VC++根据前序序列和中序序列生成二叉树的程序，并进行遍历。 很不错的参考程序。 -This is a VC++ according to the preamble sequence and the sequence binary sequence generation process, and to traverse. Very good reference program.
erchashu
- 建立一颗二叉排序树,并对其前序遍历。遍历是对树的一种最基本的运算，所谓遍历二叉树，就是按一定的规则和顺序走遍二叉树的所有结点，使每一个结点都被访问一次，而且只被访问一次。由于二叉树是非线性结构，因此，树的遍历实质上是将二叉树的各个结点转换成为一个线性序列来表示。 -Create a binary sort tree, and the preorder traversal. Tree traversal is a fundamental operation, the so-called trave