搜索资源列表
erchashudebianli.rar
- 这是一个二叉树的遍历问题
BinarySearchTree
- 一个最简单的二叉树的算法,包括二叉树的各种遍历,还添加了队列的层序遍历-a simple binary tree algorithm, including the binary tree traversal, but also adds a layer of Queue preorder
zhou_tree
- 汇编程序,输入一组数字,生成二叉树,再进行前序,中序,后序三种遍历。含错误检测。-assembler, the importation of a group of figures, generating a binary tree, and before ordering, which sequence, after three traversal sequence. With error detection.
李森数据结构作业
- 文件夹中包括常用的数据结构的算法,包括二叉树的三种递归和非递归算法,染色问题,八皇后问题,深度广度遍历,约瑟夫环,数值转换,树的高度和叶子节点数,最小生成树 ,两点之间的所有路径-folder include common data structure of the algorithm, including the three binary tree recursive and non - recursive algorithm, Dyeing, 8 Queen, depth and bread
数据结构上机实习
- 数据结构上机实验 实验题目:两个有序循环链表合并成一个有序循环链表 实验题目:欧洲地图最短路径 实验题目:稀疏矩阵基本运算及转置 实验题目: 已给定先序构造一棵二叉树的算法,请你完成其余部分,包括先序、中序、后序遍历 二叉树并打印出来。先序序列建立二叉树的顺序读入字符为A B C Ф Ф D E Ф G Ф Ф F Ф Ф Ф,注意输入时Ф用空格代替。 实验题目:复数抽象数据类型的实现
bitree111111
- 遍历二叉树使用visual c++开发环境(包括创建、插入、删除) -traverse c binary tree using visual development environment (including create, insert, delete)
gouzaoerchashu
- 构造二叉树,简单的排序,图的遍历,希望对大家有用-binary tree structure, the simple sorting, graph traversal, useful for all
jiandantudebianli
- 构造二叉树,简单的排序,图的遍历,希望对大家有用-binary tree structure, the simple sorting, graph traversal, useful for all
rdel
- 该程序是用汇编语言编写的,采用COM 文件格式。主要设计思想为:把目录当作N个结点的二叉树, 采用二叉树的先序遍历完成对盘上目录的搜索、定位,即从根目录开始用INT21H的 4EH号子功能搜索匹配目录(CL=10H)并判断搜索的结果是否为目录,若是则进入此目录,删除文件后继续搜索下一级子目录。若不是则用INT21H的4FH号子功能搜索下一个匹配目录, 并在判断为真后进入目录删除文件,如此一级一级地纵向深入子目录删除文件,直到完成此目录的最后一级子目录的文件删除(遍历左子树)。然后用INT21的4
LevelOrderTraverse
- 从键盘输入二叉树的节点数据建立二叉树,然后中序遍历-keyboard input from the binary tree data to establish binary tree node, which then preorder
binarytreetravel
- 一个可以以图形方式直观表示的树状二叉树算法程序,可以实现生成和遍历.-to be a graphic visual representation of the tree binary tree algorithm can achieve generation and traversal.
houxubianli
- Visual C++实现的二叉树的后序遍历-Visual C realization of the binary tree after preorder
PostOrderTraverse
- 后序遍历非递归二叉树源代码 很简洁,很简洁,很简洁-non - recursive binary tree source code is very simple, very simple, very simple
876753673
- 实现前序遍历四层二叉树,程序有操作提示、输入和输出,界面追求友好。-realize the former preorder four binary tree, operating procedures suggest that input and output, and the pursuit of friendly interface.
erchashubianlisuanfa
- 遍历二叉树的非递归算法,其中有先序遍历,中序遍历和后序遍历。-traversal of a binary tree non - recursive algorithm, which preorder, preorder and after preorder.
twotree
- 二叉树的遍历,都明白,别的我就不多说了,有兴趣的下载-binary tree traversal are aware, other to say I do not, are interested to see the download
binarytree-bianli
- 从键盘输入9个字符F B A D E C H G M。 • 查找结点E,并输出该结点的指针。 • 前序、中序和后序遍历输出该二叉树。 -input from the keyboard characters F 9 A B C D E G H M.
060625
- 用C实现的二叉树的建立与遍历希望大家喜欢-C achieved with the establishment of a binary tree traversal hope you like
tree3
- 二叉树的实现代码 前序遍历 中序遍历 后序遍历-achieve binary tree traversal sequence code before the order after preorder traversal
BiTNode
- BiTNode二叉树的递归和非递归遍历(包括中序\\先序\\后序)-BiTNode binary tree recursive and non - recursive traversal (including the sequence \\ first sequence \\ after Prologue)