搜索资源列表
erchashu
- 是一份比较全面的有关于，二叉树知识的讲解，其中同时包括，前缀中缀后缀的的表达形式。希望能帮到大家-Is a more comprehensive information on, on the tree of knowledge, which also include the prefix infix suffix expressions. I hope to help you! ! !
erchashu
- 实现一个二叉树的建立和写出他的前序，中序，后序遍历-The realization of a binary tree establishment and write before his order, in sequence, after the traversal
erchashu
- 实现二叉树的前序非递归遍历和比较两棵二叉树是否相似的算法。-The realization of the first order binary tree non-recursive binary tree traversal and comparison of two algorithms are similar.
erchashubianliywc
- 只要就是用来实现二叉树遍历的功能，用c++语言实现的，是比较精简的数据结构。-erchashu bianli gongneng
erchashu
- 对于二叉树的基本的运算，查找孩子结点，查看叶子节点到根节点的路径~ 二叉树的宽度。-For computing the basic binary tree to find the child node to view the leaf node to the root of the width of the path-tree.
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
shujujiegou
- 实现对任意给定的二叉树（顶点数自定）建立它的二叉链表存贮结构，并利用栈的五种基本运算（置空栈、进栈、出栈、取栈顶元素、判栈空）实现二叉树的先序、中序、后序三种遍历，输出三种遍历的结果。-Any given realization of the binary tree (self-Vertices) the establishment of its chain store binary structure, and use the five basic computing stack (The s
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