搜索资源列表
BinaryTree
- 二叉树的遍历 用c++类实现。 提供一系列成员函数,可派生。 -binarytree
expmt3
- UNIX下编程:目录树的遍历。包含文件:apue.h、error2e.c、pathalloc.c、3.c-Under UNIX Programming: the traversal tree. Include file: apue.h, error2e.c, pathalloc.c, 3.c
FDG
- 这个简单的程序写的是几种不同的对二叉树的遍历算法,在数据结构中经常可以看到。-This simple procedure is to write several different types of the traversal algorithm for binary tree in data structure can be seen frequently.
Traversingbinarytreefinddeleteupdatedatasource
- 二叉树的遍历、查找、删除、更新数据的代码-Traversing binary tree, find, delete, update data source
DataStruct
- 此文件夹中共包括十二个小程序 AVL创建平衡二叉树,通过加入一个个的结点创建,并实现了平衡二叉树中的结点删除 Boyer_Moore算法的串模式匹配 Horspool算法的串模式匹配 Graph实现了有向图的非递归广度优先遍历及非递归深度优先遍历 HeapSort利用堆排序实现优先级队列 Merge实现二路归并排序算法 MFK动态规划解背包问题 nqueue求解n皇后问题 QuickSort快速排序算法的实现。 Shell排序算法的实现。 Tree程序
gezhongbianlisuanfa
- 各种二叉树的遍历算法,一共有9种,包括是先序遍历递归算法,非递归算法一,非递归算法二,同样后序,中序遍历也各有三种,很用心,都有注释,希望有所帮助-All kinds of binary tree traversal algorithm, a total of nine kinds, including the first recursive traversal algorithm, a non-recursive algorithms, non-recursive algorithm for
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 and non-recursive traversal sequ
erchashubianliywc
- 只要就是用来实现二叉树遍历的功能,用c++语言实现的,是比较精简的数据结构。-erchashu bianli gongneng
java3
- 二叉树的定义, 编写一个main方法, 实现二叉树的中序和后序遍历,实现二叉树遍历 改编的方法-The definition of binary tree, write a main method, in order to achieve the binary tree and post-order traversal, the realization of binary tree traversal method adapted
huff
- huffman编码以及二叉树的遍历,希望对大家有用-huffman coding, as well as the binary tree traversal
binarytree
- 二叉树的遍历算法实现,其中包括先序 中序和后序遍历-Binary Tree Traversal Algorithm
tree
- 二叉树的遍历问题中关于使用二叉树进行表达式求值-Binary Tree Traversal issues on the use of the expression tree for evaluation
search
- 树的遍历(非递归方式实现):首先按中序方式建立树并输入节点信息,通过栈实现树的非递归方式的先序、中序和后序的遍历-Tree traversal (non-recursive way): First of all, by the way in order to establish the tree and enter the node information, the realization of the tree through the stack of the first non-recurs
erchashu
- 本文利用C语言实现了简单的二叉树,每个结点只保存一个整数,并且,由于非常简单,树的根结点是确定的,而不是输入的。确定根结点以后,用户输入的每一个数都被insert到树中(-999表示停止),利用深度优先的方法。建立好二 叉 树以后,分别利用深度优先(DFS)和广度优先(BFS)进行了遍历,输出结果。-In this paper, the use of C language realization of a simple binary tree, each node only maintains
erchashu
- 二叉树的遍历,包括建立一个二叉树及对其的左右遍历-A binary tree traversal, including the establishment of a binary tree and traverse its left and right
tree
- 二叉树的生成和查找,平且中序遍历生成顺序的数组-Binary tree generation and search
2009102701
- 二叉树的建立,遍历,求深度,求叶子节点的个数-The establishment of a binary tree, traversal, seeking depth, seeking the number of leaf nodes
huffman
- 利用c语言编写huffman树的遍历,质量绝对高的啦 -Using c language graph traversal, quality is absolutely high-
HAFFMAN
- 详细的HAFFMAN树的创建和遍历源代码,其中注视很详细,个人实验课所作,若有不当之处请指出。-Detailed HAFFMAN tree creation and traversal source code, which focused on a very detailed, individual lessons by experiment, if irregularities Please indicate.
ProBinaryTree
- 主要实现二叉树的建立,前序,中序,后序,和层序遍历,及实现前序,中序,后序,和层序输出-Main achieved the establishment of a binary tree, the former sequence, the sequence, after the sequence, and sequence traversal, and the realization of pre-order, middle order, post order, and the output se