搜索资源列表
BinaryTree
- 1. 建立二叉树 2. 计算结点所在的层次 3.统计结点数量和叶结点数量 4.计算二叉树的高度 5.计算结点的度 6.找结点的双亲和子女 7.二叉树的遍历 8.二叉树的输出-1. Establish binary 2. Calculate the junction point where the level 3 number of nodes and the number of statistics leaf node 4. Calculate the height
BianLiErChaShu
- 二叉树的遍历代码，包括二叉树的创建以及三种遍历方法-Binary tree traversal code, including the creation of a binary tree and three traversal methods
Data-structure
- 哈希表（带查询），哈希表的设计，树的遍历，停车场，图，约瑟夫环（链表），约瑟夫环（数组），招工考试-The hash table (with query), design of hash table, tree traversal, parking lot, figure, Joseph ring (list), Joseph ring (array), recruitment examination
btree
- 树的一些常见操作，树的创建，树节点删除，树的遍历。-Some common operations of tree, tree, the tree node deletion, tree traversal.
bitree
- 通过编写c++程序，熟悉二叉树的遍历过程，适合研究二叉树性质的人用-By writing c++ program, the familiar binary tree traversal for binary nature of the research for human use
rebuild
- 二叉树的遍历。输入两组数据，分别为二叉树的先序和中序遍历。若能构成一个二叉树，则输出后序遍历，否则输出-1.注意程序并没有建树，只是用数组下标模拟。-Binary tree traversal. Enter the two sets of data, respectively, the first binary sequence and preorder. If we can form a binary tree, the rear output preorder, otherwise the
er-chashu
- 二叉树的遍历 二叉树的遍历 -er cha shu de bian li
NTreeTraverse
- N叉树的遍历，建立任意N叉树，实现对其遍历的功能，JAVA语言-N-tree traversal, and establish an arbitrary N-tree, to achieve its traversal function, JAVA language
bianli
- 能够帮助大家了解二叉树的遍历算法，其中包括 先序遍历、中序遍历和后序遍历。-It can help you understand the binary tree traversal algorithms, including Preorder, preorder and postorder traversal.
tree
- 树的遍历，源码短小精悍！仅供参考!在学习数据结构时，提供有力支持！-Exploring the tree of data construction.It s simplier than others! It s only for study each other!
DoubleLinkedList
- java的二叉树写法，基本思路为，二叉树的遍历-a base java project
hw9
- 树结构的运用，树的遍历，叶子节点，广搜深搜及其实现，很多功能都有-tree achieve
二叉树演示
- 用于课程设计 ，二叉树相关操作的演示，前序遍历，，放大器设置等。可以随机创建，手动创建二叉树
2_Tree
- 二叉树的遍历算法，后序遍历的非递归实现。-2-Tree algorithm
Tree-establishment-and-traversal
- 树的遍历与查询，各种细致的操作都具备，操作很完备-Traversal of the tree and query, all kinds of detailed operations are available, the operation is complete
tree
- 编码树的遍历，找的时候还没在网上找到相对应的内容。对应于中大的数据结构实验.-Traverse coding tree in a large experimental data structure corresponding to
graph
- 树的遍历，里面是dfs，以及他的creat-tree s int creat and dfs
include
- c 语言实现二叉树的遍历，插入，删除等 数据结构实验-c language to achieve binary tree traversal, insert, delete, etc. experimental data structure
binary-tree-traversal
- 二叉树的遍历 数据结构c/c++ 描述 开发环境为VS2013-Data structure c/c++ binary tree traversal
2chashu_bianli
- 该功能主要用vc++实现。实现二叉树的遍历算法。遍历的方法是先序遍历。-the funcontioin of the program is find a point in the tree in the struture of data .and then the method of it is LF.