搜索资源列表
第六章 树和二叉树习题答案
- 第六章 树和二叉树习题答案-The answer of tree and binary tree
二叉树的深度
- 用递归求出二叉树的深度-derived using recursive depth of the binary tree
Java 二叉树 算法
- 用Java编写的二叉树的数据结构，包括二叉树的每个节点的值，以及各子树的指针。 -Java prepared by the binary tree data structures, including binary tree each node values, and the subtree target.
奇妙的二叉树
- 奇妙的二叉树.rar 里面对数据结构里的二叉树进行了非常详细的说明,对大家学习数据结构有非常大的好处-wonderful binary tree. Rar inside of the data structure, the binary tree for a very detailed descr iption of the data structures you learn a lot more benefits
3二叉树
- 这是一个用可以解决二叉树先序，中序，后序排列的程序-This is a binary tree can be solved with first sequence, sequence after sequence with procedures
二叉树排序
- 实现二叉树的前序、中序、后序排列，以菜单形式出现-achieve binary tree of the former sequence, sequence after sequence arranged in the form of a menu
建立、使用二叉树的程序
- 建立、使用二叉树的程序，内含源程，是数据结构中必学知识。-established procedures for the use of binary tree, the source of intron way, the data structure is certainly knowledge.
二叉树排序
- 实现二叉树的前序、中序、后序排列，以菜单形式出现-achieve binary tree of the former sequence, sequence after sequence arranged in the form of a menu
二叉树的中序遍历和存储
- 用c实现的二叉树的中序遍历的读取与存储，能体现出向左倒的二叉树的打印界面，界面简单。-achieved using the binary tree traversal sequence which read and storage, will be shown left one of the binary tree Print interface that simple.
二叉树的连接存储
- 假设二叉树用链接存储结构进行存储，root指向根结点，p所指结点为任一给定的结点，编写一个求出从根结点到p所指结点之间路径的函数。-assumptions used to link storage structure for storage, root at Root, p referring to the node to a set of nodes, obtained from a prepared Root referred to p path between nodes function
二叉树改进041123
- 输入结点和结点数生成二叉树，可以左遍历，右遍历，后遍历！-input nodes and nodes generate binary tree can traverse left and right traverse, traverse after!
二叉树作业
- 我的数据库作业.二叉树的操作和使用.相信计算机相关专业的学生用的着.一起分享吧-the operation of the database. Binary Tree, the operation and use. I believe computer-related professions with the students. Share it
二叉树的生成与遍利
- 二叉树-binary tree !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
Java二叉树的后续遍历
- Java二叉树的后续遍历 Java二叉树的后续遍历主要应用于逆波兰式的求解,在编译中很重要.-Java two following forks the tree traversal Java two following to fork the tree traversal mainly applies in goes against the Poland -like solution,Is very important in the translation
二叉树
- 二叉树的操作，学习数据结构的时候，相信大家都知道二叉树是其中比较重要的概念吧。-Binary Tree, the operation of the data structure learning time, I believe we all know binary tree is the more important concept it.
二叉排序树与平衡二叉树
- 数据结构常用算法设计 用C++实现二叉排序树与平衡二叉树-algorithm commonly used data structures designed to achieve two C-tree fork and balanced binary tree
遍历二叉树
- 按层遍历二叉树的算法设计C语言数据结构作业-layer by the binary tree traversal algorithm design C language data structures operations
建立二叉树
- 同济大学课程设计中的一道题! 要求能够输入树的各个结点，并能够输出用不同方法遍历的遍历序列；分别建立建立二叉树存储结构的的输入函数、输出层序遍历序列的函数、输出先序遍历序列的函数.-Tongji University in curriculum design, the one that! Tree request to enter the various nodes, and can output using different methods traverse the traversal se
属性均值聚类二叉树及其在人脸识别中的应用
- 采用二叉树数据结构，属性均值聚类算法在图象识别中的应用。-using a binary tree data structure, attributes means clustering algorithm in image recognition applications.
二叉树的生成与遍历
- 建立并按前,中,后序方法遍历二叉树,本代码用的是非递归方法,递归方法的稍后给出-established as before, during and after the binary tree traversal sequence method, the code of non - recursive method, recursive method is later