搜索资源列表
erchashu
- 实现二叉树的排序 实现二叉树的前序、中序、后序排列,以菜单形式出现-To achieve the realization of binary tree binary tree sort of pre-order, in sequence, arranged after the order to the form menu
erchashu
- 二叉树排序 采用中序遍历的方式 从小到大排序输出-Binary tree traversal order used in a way to sort the output from small to large
erchashu
- 数据结构二叉树的遍历 例如 输入abc..de.f..g... 输出其先序遍历中序遍历后序遍历-例如 输入abc..de.f..g... 输出其先序遍历中序遍历后序遍历
erchashu
- 关于二叉树的期末课程实验。。。比较完善的-Courses on the tree at the end of the experiment. . . Relatively perfect
erchashu
- 量越高得到的下载个数越多(一般上传5个,可以下载200个)。 -putk jkjdk d slgkj lkgjks s
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
- 二叉树的查找与构成及其形成原理,对于二叉树的查找原理!-Find the tree and its form and principle, the principle of the binary tree search!
erchashu
- 本程序包括二叉树的创建,各种遍历方法(前序,中序,后序以及各层算法)。-This process includes the creation of a binary tree, various traversal methods (pre-order, middle order, post order, and layers of algorithm).
erchashu
- 使用VC编写的二叉树程序,简单明了,方便使用-Written in binary tree using the VC program, simple and clear, easy to use
erchashu
- 二叉树的遍历,包括建立一个二叉树及对其的左右遍历-A binary tree traversal, including the establishment of a binary tree and traverse its left and right
erchashu(AVL)Cshixian
- AVL在实际服务端应用中较多见,它的主要好处是原理简单并且具有良好的搜索/插入/删除速度(时间复杂度均为O(logN)).这里贴一个我写的简单实现,-AVL server-side applications in practice more see, its main advantage is that is simple in principle and has a good search/insert/delete speed (the time complexity are O (logN
erchashu
- 此程序时数据结构中二叉树的各种算法,关于二叉树的各种算法具有-This program in the binary tree data structure of various algorithms on a variety of binary tree algorithm has
erchashu
- 可以创建二叉树,先序遍历二叉树,后序遍历二叉树,按层遍历二叉树,交换左右子树并输出-You can create a binary tree, binary tree preorder traversal, postorder binary tree, by traversing a binary tree level exchange of left sub-tree and output
aa
- 二叉树的便利算法等算法,还差不多点的算法巴-ERCHASHU
erchashu.txt
- 包括二叉树的建立和查找,是查找算法的一种,大家可以看看,参考一下。-Including the establishment of a binary tree and search is a search algorithm, we can see that reference.
erchashu
- 在二叉树中查找值为X的结点,试设计打印值为X的结点的所有祖先的算法-In the binary tree to find a value of X, node, trial designed to print the value of X, all the ancestor nodes the algorithm
erchashu
- 1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示:验证是否交换可以调用二叉树的遍历算法,比较输出结点序列。 3 编写一个主函数,将上面函数连在一起,构成一个完整的程序。 4 调试并运行实验源程序。 -Prepared using a binary list stored in binary form of the creation, the first sequence, the seq
erchashu
- 实现二叉树的基本功能,包括前序遍历,中序遍历,后序遍历,层次遍历-To achieve the basic functions of a binary tree, including the pre-order traversal, inorder traversal, postorder, level traversal
erchashu
- 二叉树查找,可以随意输入要查找的范围,然后找其中的一些-Binary tree search, you can freely enter the search range, and then find some of them
erchashu
- 使用TC的数据结构的基本操作——二叉树的基本操作-TC data structure using the basic operations- the basic operation of a binary tree