搜索资源列表
btree
- 二叉树的遍历、插入、删除以及求二叉树的高度-Binary tree traversal, insert, delete, and find the height of binary tree
erchashu
- 详细介绍了二叉树三种遍历的非递归算法，有参考价值-Traversing binary tree described in detail the three non-recursive algorithm, a reference value
Binary-Tree
- 自己输入一个二叉树，再分别用前序、中序、后序法遍历这个二叉树。-Input a binary tree, and then were used to pre-order, in order, after the sequential traversal of this binary tree.
PostOrderBtree
- 使用两个栈的结构来解决二叉树的后序遍历的非递归算法。-Use two stacks to solve the structure of the binary tree postorder traversal of the non-recursive algorithm.
erchashu
- 本文利用C语言实现了简单的二叉树，每个结点只保存一个整数，并且，由于非常简单，树的根结点是确定的，而不是输入的。确定根结点以后，用户输入的每一个数都被insert到树中（-999表示停止），利用深度优先的方法。建立好二 叉 树以后，分别利用深度优先（DFS）和广度优先（BFS）进行了遍历， -In this paper, a simple C language binary tree, each node only stores an integer, and, due to the very
binary-tree
- 实现二叉树的各种遍历，层次遍历，先序遍历，后序遍历等-Realize all kinds of a binary tree traverse, LevelOrder Traverse , preorder traversal ,postorder traversal
Tree
- 基于java的生成二叉树程序。可进行前序遍历、中序遍历、后序遍历-Java program based on the generation of binary tree. Can be pre-order traversal, inorder traversal, postorder traversal
Binary-Tree
- 本程序实现了对二叉树的前、中、后和层序的遍历-The program realization of the binary tree before, during, and after the traversal sequence
BinaryTree
- 二叉树的基本实现（前序中序构造，后序中序构造，前序中序后序遍历）-The basic binary tree implementation (pre-order in the order structure, sequence after sequence of construction, pre-order in the post-order traversal order)
erchashu
- 数据结构 二叉树的基本操作实现 遍历文件夹并建成目录树，一个较好的遍历程序，对系统所有的文件获取做了比较详细的说明。程序在2000下通过。-Bi tree typedef struct bitree char data struct bitree*left,*right basic use of tree create init queue push queue empyt. hope you like it.
ecs
- 二叉树的创建、插入、删除、前序中序后序遍历。-Binary tree to create, insert, delete, inorder preorder postorder traversal.
NewTree
- 根据二叉树前序和中序遍历建立二叉树的非递归算法，并输出二叉树模型和前序遍历和中序遍历 与已知对比-Build binary tree according to preorder view and inorder view
bitree
- 二叉树的遍历（前序遍历、中序遍历、后序遍历、层序遍历等）-Binary tree traversal (pre-order traversal, inorder traversal, postorder traversal sequence traversal, etc.)
BiTree
- MFC 二叉树的建立，递归遍历，非递归遍历-MFC build a binary tree, recursive traversal, non-recursive traversal
BitTree
- C/C++实现对二叉树的各种遍历、求叶子节点数等操作。结构清晰、有注释。-C/C++ implementation of the various traverse binary tree, find the leaf nodes and other operations. Clear structure, with comments.
HFTree
- 实现了哈夫曼编码译码系统，采用二叉树的中序遍历。C++语言描述-C++ HfmTree coding and decoding System
B-tree
- 输入一棵二叉树的扩展的前序序列，经过处理后生成一棵二叉树，然后对于该二叉树输出前序、中序和后序遍历序列。-Enter the extension of a binary tree sequence of the first order, a binary tree generated after treatment, then the binary output for pre-order, the order and post order traversal sequence.
BINARYTR
- 建立二叉树及二叉树的先序、中序和后序递归遍历*-Create a binary tree and binary tree preorder, inorder and postorder recursive traversal*
erchashu
- 二叉树的三种遍历方法:建立二叉树/先序遍历/中序遍历/后序遍历-Three binary tree traversal method: Create a binary tree/preorder traversal/inorder traversal/postorder traversal
binarytree
- 内含两篇学术论文，由遍历序列构造二叉树的非递归算法实现，基于遍历序列的构造严格二叉树的算法，供需要的朋友借鉴-Contains two papers, a binary tree constructed by the traversal sequence to achieve a non-recursive algorithm, based on the construction of strict binary tree traversal sequence algorithm for dra