搜索资源列表
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
- 这也是本人上学期学数据结构是做的 各种搜索方式都有 我的心血啊 分享了 哈哈！-This is my last semester data structure is to do a variety of ways to search the hard work I have shared ah ha ha!
erchashu
- 使用中序遍历，先序遍历，后序遍历，交换左右子树，计算结点数，计算树的高度-Use traversal first traversal, after traversal exchange about subtree, computing nodes, computing the height of the tree
erchashu
- 二叉树的C++代码 用处很多的哦 尤其对那些正在学数据结构的同学而言-Binary Tree C++ Code Oh, a lot of useful especially for those who are school students in terms of data structure
erchashu
- 用c语言实现的关于二叉树的各种操作，适合初学数据结构的人-C language used on the binary tree to achieve a variety of operations, data structures suitable for beginners who
erchashu
- 二叉树的各种遍历，用菜单形势实现的。前序中序后序层序-A variety of tree traversal, using the menu situation achievable. Preorder in sequence after sequence sequence
erchashu
- 有关二叉树的各种操作，可以运行。没有人祸问题。程序包括二叉树的各种遍历方法，和建立等待-A variety of tree-related operations, can run. No man-made problems. This process includes a variety of binary tree traversal methods, and the establishment of waiting
erchashu
- 二叉树的创建（按照先序创建二叉树），后序的方式进行查找-The creation of binary tree (in accordance with the first order to create binary tree), after the order to find a way
erchashu
- 课程设计题目： 对二叉排序树T作相关操作 (作中序遍历求平均查找长度删除结点及判断是否为平衡二叉树) -Course Design Title: on the binary sort tree T for related operations (for medium-traversal to find the length of the average for the deletion of nodes and determine whether to balance the tree)
erchashu
- 二叉树的遍历 先序 中序 后序 遍历和层次遍历-Binary tree traversal sequence in the sequence after the first traversal and the traversal level
erchashu
- 实现二叉树三种周游，即先根周游，后根周游同对称周游。可选择-Binary tree to achieve the three travel, that is, around the first root, root around the same symmetry around. Optional
erchashu-c
- 二叉树所有操作的c程序，包括建立，插入，遍历，删除等等，已经通过调试-C binary tree of all operations procedures, including the establishment of, insert, traverse, delete, etc., have been through debugging
erchashu
- 二叉树的小程序，比较简单，适合初学者，大家看看哈-er cha shu de xiao cheng xu，shi he chu xue zhe，da jia kan kan
ERCHASHU
- 关于二叉树的一些基本操作，包括查找，添加，删除结点-About some of the basic binary tree operations, including search, add, delete node and so on
erchashu
- 利用c编写的二叉树的四则运算的程序！希望对你有用,谢谢你的选择！-The preparation of the binary tree using c 4 of the procedure computing! Hope that useful to you, thank you for your choice!
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.