搜索资源列表
order_of_tree
- 使用c语言编写的树的遍历算法，包括前序、中序、后续和层次遍历。-Four tree traversal algorithms, including preorder，inorder，postorder and level traversal.
binary-tree
- 二叉树的遍历,包括先序遍历,中序遍历和后序遍历-traversing binary tree
stacknode
- 栈这种数据结构是一个工具性的数据结构，通常被其它复杂数据结构所使用。比如实现二叉树的遍历的非递归算法。下面就用C++模板实现栈数据结构的一个较完整代码！在书本《数据结构（C语言版）--严慰明》提到栈可以用数组，也可以用链表实现，这里只用链表实现这一数据结构。-This data structure is a stack instrumental data structure is often used for other complex data structures. Such as a bi
tree
- java实现二叉树的遍历非递归版，比较容易实现的。-java achieve binary tree traversal non-recursive version, relatively easy to achieve.
american_heritage
- USACO中的American heritage，用C++编写，运用了树的遍历知识-the American heritage of USACO, with C++ prepared, using a tree traversal knowledge
multiway-tree-______
- 通过指针的方式建立多叉树，源码中包括多叉树的建立，多叉树的遍历，多叉树的插入等操作，建立多叉树和对多叉树的遍历采用了c++标准模板库中队列，map，list等操作。 -Through pointers way to create multi-tree, the source code is included in multi-tree creation, multi-tree traversal, multi-tree insertion and other operations, the es
7.Binary-Search-Tree
- 二叉树收索，包括二叉树的遍历，收索，增加，删除等功能-Close binary search
erchashu
- 二叉树的遍历方法，有递归类型的，有非递归类型的-Binary tree traversal methods, there are recursive types, there are non-recursive types. . .
erchashubianli
- 二叉树的遍历和操作 计算机软件基础-Two binary tree traversal and operating computer software foundation
clib
- 包含多种基本数据结构的实现，如堆、栈，队列，树的遍历（包括递归遍历和非递归遍历）-this file including many basic data structure, including heap,stack,queue,tree(tree s recursive traversal and non-recursive traversal)
The-basic-operation-of-a-binary-tree
- 二叉树的基本操作。包括树的（先序、中序、后序）创建、树的遍历（先序、中序、后序）、树的高度、树的宽度、树的叶子节点数-The basic operation of a binary tree. Including tree (first order, in sequence after sequence) created tree traversal (first order, in sequence after sequence), tree height, tree width, tree
1
- 二叉树的遍历算法程序 先序 中序 后序-Binary tree traversal algorithm first sequence in the sequence after sequence so like
erchashu
- 二叉树的链式存储、先序中序遍历和层次遍历。（构造一棵树并输入数据，编写三个函数，非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法（这里的非递归以中序为例）。在主程序中调用这三个函数进行树的遍历，观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。）-Chain store binary tree, preorder traversal and hierarchy traversal.
Tree-traversal
- 树的遍历。树的缩格打印、先根遍历，中根遍历，后根遍历的递归非递归调用，交换左右子树递归调用。-Tree traversal. Tree indent printing, the first root traversal, traversing root, root recursive traversal non-recursive calls, switching left and right subtrees recursively.
Binary-tree-traversal-algorithm
- 数据结构中，实现二叉树的遍历，包含前序，中序和后序-Data structure, binary tree traversal, including former preorder, inorder and postorder
er-cha-shu-
- 一棵非空二叉树可以看作是由根结点、左子树和右子树这三个基本部分组成的。如果能依次遍历这三个部分的信息，也就遍历了整个二叉树。由此得到的二叉树的遍历是按某种策略访问二叉树中的每一个结点且仅访问一次的过程。二叉树的遍历按访问根结点的先后次序不同分为前序、中序和后序三种。-A non-empty binary tree can be seen from the root node, the left subtree and right subtree consists of three basic p
ExamCpp--
- 单链表，单循环链表，双链表，循环双链表的实现，二叉树的遍历与实现。森林与树的转换以及图的深度广度遍历，邻接矩阵邻接表实现-Single list, round robin list, double-linked list, circular double-linked list implementation, and implementation of a binary tree traversal. Forest conversion, and the depth and breadth of
tree
- 二叉树的遍历，可以计算叶子数，交换左右子树，输出查找路径-Binary tree traversal, you can calculate the number of leaves, the exchange about the sub-tree, the output search path
eight
- 一个简单的解决八数码问题的程序,采用树的遍历的思想-a simple program to solve the eight question
sjjgsy
- 数据结构实验验收源码，包含二叉树的遍历，图的遍历，停车场管理系统以及哈希表的应用-Experimental data structure acceptance source, contains two binary tree traversal, traversal, parking management system and the application of hash table