搜索资源列表
btree2
- 实现输入二叉树并对它进行先序中序后序遍历-achieve input binary tree as well as its first order for the order after the preorder
blasdfew
- 以先序,中序,后序遍历二叉链表的非递归算法-to be the first sequence, sequence, after the preorder the binary tree of non - recursive algorithm
graph
- 数据结构有关图的算法。矩阵和链表实现的都有。实现先序中序后序遍历算法。
Binary_tre1762296262004(1)
- 程序用于实现二叉树的建立及先序中序后序的遍历
btree2
- 实现输入二叉树并对它进行先序中序后序遍历-achieve input binary tree as well as its first order for the order after the preorder
blasdfew
- 以先序,中序,后序遍历二叉链表的非递归算法-to be the first sequence, sequence, after the preorder the binary tree of non- recursive algorithm
graph
- 数据结构有关图的算法。矩阵和链表实现的都有。实现先序中序后序遍历算法。-Data structure on the graph algorithms. Matrix and list of all realize. Realize after the first sequence in the sequence traversal algorithm.
Binary_tre1762296262004(1)
- 程序用于实现二叉树的建立及先序中序后序的遍历-Procedures used to realize the establishment of tree and the first sequence in the sequence after the sequence of traversal
binarytree
- 数据结构 二叉排序树 先序中序后序遍历 二叉树的查找-Data structure binary sort tree preorder traversal sequence after sequence of binary tree search
erchashu
- 二叉树的遍历 先序 中序 后序 遍历和层次遍历-Binary tree traversal sequence in the sequence after the first traversal and the traversal level
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算
TreeTraverse
- 二叉树的遍历操作，树结构用二叉链表存储，遍历时采用递归先序 中序 后序，层次遍历和非递归先序 中序 后序遍历-Binary tree traversal operations, binary tree structure list with storage, the use of recursive traversal sequence in the sequence after the first sequence, level an
BinTree
- 创建二叉树,然后先序,中序,后序遍历二叉树中的各元素.-Create a binary tree, and then the first order, in sequence, after the tree traversal of the element.
hh
- 用递归实现二叉树的先序,中序,后序3种遍历.-Binary tree with recursive realization of the first order, in sequence, the latter three kinds of traversal sequence.
binarytree
- 用C语言实现二叉树的先序中序后序以及层次遍历的算法-Binary tree using C language after the first sequence in the sequence order and hierarchy traversal algorithm
erchashu
- 二叉树 图形演示 创建 先序 中序 后序 查找 删除 -erchashu tuxingyanshi
The_operation_of_the_tree
- 用C++实现了数据结构中树的操作 包括树的构建、先序中序后序遍历、树的拆除、结点的添加与删除、树的深度计算等 程序调试完全通过-Achieved with C++ data structure tree operations include the construction of the tree, the first sequence in the sequencing order traversal, tree removal, n
erchashu
- 建立一颗用二叉树链表方式存储的二叉树，斌对其进行表里（先序中序后序），打印输出表里结果。-Create a list using a binary tree stored in the binary tree, its bin table (after the first sequence in the sequence order), print out the result table.
bintree
- 实现二叉树的先序中序后序的递归与非递归查找-Binary tree in order to achieve the first order after the order of the recursive and non recursive search
1160300803_樊静_实验二
- 森林和树的基本操作 ，森林的存储，森林转化成二叉树，二叉树的先序中序后序非递归遍历，以及区间编码(The basic operations of forests and trees, the storage of forests, the conversion of forests into two forked trees, the preorder and the post order of the two forked tree