搜索资源列表
erchashu
- 构建一个二叉排序树，使输入的学生信息可以按照成绩从高到低排序，放入顺序表之中，再顺序输出，属于数据结构入门级别的程序-Build a binary sort tree, so that the input information the students can follow the scores from highest to lowest sort, put into the sequence table, and then output in the order, is a data th
erchashu
- 用c语言实现的关于二叉树的各种操作，适合初学数据结构的人-C language used on the binary tree to achieve a variety of operations, data structures suitable for beginners who
erchashu
- 二叉树的小程序，比较简单，适合初学者，大家看看哈-er cha shu de xiao cheng xu，shi he chu xue zhe，da jia kan kan
erchashu
- (1)以回车( \n )为输入结束标志，输入数列L，生成一棵二叉排序树T； (2)对二叉排序树T作中序遍历，输出结果； (3)计算二叉排序树T查找成功的平均查找长度，输出结果； (4)输入元素x，查找二叉排序树T，若存在含x的结点，则删除该结点，并作中序遍历(执行操作2)；否则输出信息“x不存在”； (5) 输入元素x，查找二叉排序树T，若整棵树不存在含值为x的结点，则插入该结点，并作中序遍历(执行操作2)；否则输出信息“x已经存在”。 -(1) to return ( &#
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
- 关于二叉树的期末课程实验。。。比较完善的-Courses on the tree at the end of the experiment. . . Relatively perfect
erchashu
- 量越高得到的下载个数越多(一般上传5个，可以下载200个)。 -putk jkjdk d slgkj lkgjks s
erchashu
- 二叉树的查找与构成及其形成原理，对于二叉树的查找原理！-Find the tree and its form and principle, the principle of the binary tree search!
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
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
- 二叉树操作,包括了二叉树的建立，查找，求深度高度，计算结点数-Binary operations, including the establishment of a binary tree, find, seek the depth of the height of the calculation nodes
erchashu
- 请具体设计一个算法求二叉树叶子节点和高度-Please specify design an algorithm binary tree leaf node and a high demand
erchashu
- 实现二叉树的非递归先序、中序、后序以及层序的遍历-Implementation of the computer science first order, in order, after the traversal sequence and the sequence
d
- 二叉树的插入操作删除操作打印操作并用菜单形式实现-use erchashu
erchashu
- 二叉树的建立、显示、遍历（包含非递归及递归2种算法）-The establishment of a binary tree, display, traverse (including non-recursive and recursive algorithm 2)