搜索资源列表
2
- 根据二叉树的抽象数据类型的定义，使用二叉链表实现一个二叉树。 二叉树的基本功能： 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 9、其他：自定义操作-According to a binary tree definition of abstract data types, use two forks to achieve a binary
2cs
- 用队列实现二叉树的层次遍历，欢迎大家分享-To achieve the level of binary tree using a queue traversal, welcome to share
Tree_Frame
- 掌握二叉树的创建、遍历的方法。 利用二叉树的按层遍历序列创建二叉树，然后实现二叉树的前序、中序和后序遍历。-Master binary tree creation, traversal methods. The use of binary tree traversal sequences by layer to create a binary tree, and then to achieve binary tree preorder, inorder and postorder trave
fengmanshu
- 丰满树操作: 用顺序存储结构实现； 结点形式：下标，元素值； 功能：查找结点，结点的中序前驱，中序后继，中序遍历，插入结点，删除结点 -Fullness of the tree operations: storage structure in order to achieve junction forms: The next standard, element values function: to find nodes, nodes in the precursor seq
zhubianli
- 实现树的创建算法，创建一个至少包含3层，8个结点的二叉树，并对此树实现先中后序的递归遍历算法。输出三种遍历结果。再实现一个叶子结点查找算法，判断一个给定的数值是否在此树中作为叶子结点。-To achieve the creation of the tree algorithm, to create at least a three-layer, 8 nodes of a binary tree, and after this tree in order to achieve the first
3
- 我自己写的小程序，都是数据结构时候的试验，花了心血的，主要包括二叉树的一些遍历算法（都是非递归实现的），Huffman编码，还有多项式的混合运算，包括加减乘除-I write small programs, are data structures when the experiment took effort, and mainly includes a number of binary tree traversal algorithm (both non-recursive implement
graph
- 该压缩文件中包含了图论当中的一些重要算法，包括前序中序和后序遍历、最小二叉树、DFS、BFS以及拓扑排序。-The compressed file contains a graph theory among a number of important algorithms, including the former order in the order and postorder traversal, the smallest binary tree, DFS, BFS, and topolog
ds_4
- 1．定义二叉树的链式数据结构。 2．编写函数，创建下图所示的二叉树。 3．编写函数输出二叉树的先序、中序、后序遍历。-1. The definition of binary tree data structure chain. 2. Write a function, create a binary tree as shown in figure below. 3. Write function, the output of the first binary sequence, in o
tree
- 本程序可以用三种方法建立二叉树，并实现相应功能。1、通过输入树的嵌套括号表示序列建立二叉树；2、根据前序遍历序列和中序遍历序列建立二叉树；3、建立哈夫曼树-This program can use three ways to establish a binary tree, and to achieve that function. 1, by entering the tree to establish a sequence of nested parentheses binary tree
Tree
- 主要是二叉树的一些性质的操作。包括复制，清空，求取树高，树中元素的个数，得到根结点，父亲结点，所有祖先，左儿子，右儿子，插入左儿子，右儿子，查找某个元素，以及前、中、后、层次遍历和相关的操作。另外，可以树形显示这棵树的信息。-Some properties are mainly binary operation. Including reproduction, empty, to strike a tree height, the number of elements in the tree g
btree
- 主要用于二叉树的建立，先序，中序，后序遍历，其由两部分构成，头文件和实现文件。-btree，create，search
erchashu
- 实现二叉树的基本功能，包括前序遍历，中序遍历，后序遍历，层次遍历-To achieve the basic functions of a binary tree, including the pre-order traversal, inorder traversal, postorder, level traversal
1
- 建立一颗用二叉链表方式存储的二叉树，并对其遍历，打印输出遍历结果。-The establishment of a list with the 2 fork stored in a binary tree, and its traverse, traverse the results printout.
Binary
- 二叉树的动态链表存储结构及表示，二叉树的三种遍历算法（递归和非递归两类）运用二叉树三种遍历的方法求解有关问题-Binary tree structure and the dynamics of linked list is stored, said three kinds of binary tree traversal algorithms (recursive and non-recursive types) the use of three kinds of binary tree tra
BinaryTree
- 二叉树的相关操作，实现前序，中序，后序遍历，算元素个数，树高-Binary tree-related operations, to achieve pre-order, middle order, postorder, count number of elements, tree height,
jingdiansuanf
- 二叉树的递归与非递归遍历(Java描述)，高效实现Josephus算法，合并有序链表，基于队列实现的基数排序，栈.回溯.迷宫问题求解。5个算法的源程序。-Recursive and non recursive binary tree traversal (Java descr iption), efficient algorithms to achieve Josephus, merging sorted linked list, queue-based implementation of ra
queue
- 队列，用顺序或链式结构实现一个队列，采用二叉链表存储结构，用递归方式建立二叉树对 应的二叉链表，并建立队列实现该二叉树的层次遍历序列的输出。 -Queue, with the sequence or chain structure to achieve a queue, using the binary storage structure list, using a recursive approach to building a binary tree corresponding to
shiyanbaogao
- 动态查找表的设计与实现,实现抽象数据类型：二叉查找树。实现下列操作:构造空表、销毁表、搜索指定关键字的元素、插入新元素、删除指定关键字的元素、遍历表中所有元素. -Dynamic look-up table of the design and implementation to achieve the abstract data types: binary search tree. To achieve the following: construct an empty table, des
SDLTree
- 动态链表存储的树的c++代码实现 树的三种遍历的c++代码实现-Dynamic list stored in the tree c++ code to achieve the three kinds of tree traversal of the c++ code to achieve the
xiansuo
- 1 理解树结构的逻辑特性； 2 熟练掌握二叉树的逻辑结构特性及各种存储方法； 3 熟练掌握二插树的各种基本操作，尤其是三种遍历算法以及线索化算法。 4 进一步了解和掌握类的私有和公有成员函数的定义和使用以及类型的作用域 -A tree structure to understand the logic of identity two master binary logic of structural characteristics and various st