搜索资源列表
shu
- 二叉树的遍历,先序,中序,后序,层序遍历-Binary tree traversal, preorder, inorder, postorder sequence traversal
erchashu
- 假设自上而下按层次，自左至右输入每个结点的一个三元组(N, P, L/R)。其中N为本结点的元素，P为其夫结点，L指示N为P 的左孩子，R指示N为P的右孩子。试写一个建立二元树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。 -Assuming that the top-down hierarchy, from left to right input each node is a triple (N, P, L/R). N oriented junction element t
b
- 完成向二叉树中插入节点（即构建二叉树）、删除二叉树、复制二叉树，并完成中序遍历（返回节点数）、层序遍历（返回层高），测试程序结果应当完全正确-Completed to insert nodes in a binary tree (that is to build a binary tree), delete the binary tree, copy the binary tree, and completed in order traversal (return nodes) layer pr
erchashu
- 先序扩展序列建立二叉树,二叉树的先序,中序,后序遍历的递归与非递归算法,层序遍历,以及求树的深度.-First order expansion preorder, inorder, postorder traversal sequence to establish binary tree, binary tree recursive and non-recursive algorithm, the depth of the layer preorder traversal, as well as
yy
- 实现二叉树中所有节点左右子树的交换,有前序遍历、中序遍历、后序遍历以及层序遍历-About all the nodes in a binary tree subtree exchange, there are pre-order traversal, preorder, and postorder traversal sequence
Homework_BiTree
- 二叉树的建立、遍历输出，包括先根遍历、中根遍历、后根遍历、层序遍历-The establishment of a binary tree, traversal outputs, including the first root traversal, traverse the root, dorsal root traversal, preorder layer
Bitree
- 二叉链表表示法编写的二叉树工程，包含前序、中序、后序和层序遍历成员函数-Binary Engineering
tree
- 孩子兄弟表示法树工程，含前序、后序、层序遍历成员函数-Children brothers notation tree works, including former sequence after sequence, sequence traversal member functions
QBiTree
- 利用非递归的方法实现数据结构中的层序遍历-The method of using non-recursive data structure traversal sequence
exp8
- 对二叉树的删除、复制、中序遍历采用递归方式实现。 层序遍历采用辅助队列数据结构完成，为了计算层高， 使用了两个队列，交替的向两队列中插入相邻的两层， 这样完成层高的统计。-On the binary tree delete, copy, preorder recursive manner. Traversal sequence complete with assisted queue data structure, in order to calculate storey,
BinaryTree
- 使用VS2010编程，二叉树的前序、中序、后序、层序遍历，无界面。-Using VS2010 programming, binary tree sequence, sequence after sequence, sequence traversal, no interface.
Dome
- 1.采用链式结构实现任意多项式的存储，求两个多项式的和。 2.假设自上而下按层次，自左至右输入每个结点的一个三元组(D, P, L/R)。其中D为本结点的元素，P为其父结点，L指示D为P 的左孩子，R指示D为P的右孩子。试写一个建立二叉树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。 3.采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。-1 using an arbitrary polynomial chain structure of storag
main22
- 二元树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。-Binary tree in memory of the double-stranded representation algorithm and achieve first root, the root, root, and layer after traversal algorithms.
Tree
- 二叉树的创建，二叉树的先序、中序、后序和层序遍历，树叶的统计，层数的统计-The creation of a binary tree, binary tree first order, in sequence, after the traversal and layers, leaves statistics, statistical layers
Binary-tree-traversal
- 二叉链表遍历，可以使用递归和非递归方法实现二叉树的前序，中序和后续遍历，以及层序遍历-Binary tree traversal, you can use recursive and non-recursive method to achieve binary tree preorder, inorder traversal and follow-up, as well as layer preorder
the-telephone-number-looskup-system-
- 数据结构课程设计 用二叉树实现电话号码查询 前中后序遍历 层序遍历 查祖先 树的深度-Binary tree data structure courses designed to achieve Phone Number Lookup ago after preorder traversal sequence ancestor tree depth investigation
search-tree
- 建立二叉树，层序、先序遍历 要求能够输入树的各个结点，并能够输出用不同方法遍历的遍历序列；分别建立建立二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数；-Establishment of a binary tree, sequence, preorder required to enter each node of the tree, and can output traversal sequences of different methods to traverse
erchashu
- 用下面两种方法中的任一种建立y一棵n层的满二叉树。 (1) 按先序遍历递归调用建立链式满二叉树； (2) 按层序遍历二叉树方式建立链式满二叉树。 （3）把二叉树得凹入表示法打印出来 -Use either of the following two methods to establish a y a n-tier full binary tree. (1) according to preorder a recursive call to establish a chain fu
datastructure_binary-tree
- 二叉树的基本功能的实现：建立空二叉树，前序、中序、后序、层序遍历二叉树，计算叶子数、层数等基本功能-Achieve the basic functions of a binary tree: Create an empty binary tree, the former sequence, sequence after sequence, sequence binary tree traversal, calculating the number of leaves, layers and ot
tree
- 树的模板实现，前序遍历、中序遍历、层序遍历等-the preordertraverse,postordertraverse,levelpreordertraverse