搜索资源列表
sy3
- 二叉树的基本操作， 1．以二叉链表表示二叉树，建立一棵二叉树 2．输出二叉树的前序遍历结果 3．输出二叉树的中序遍历结果 4．输出二叉树的后序遍历结果 5．统计二叉树的结点个数 6．统计二叉树的叶结点个数 7．计算二叉树的深度 -Binary Tree s basic operations, 1. List said in binary tree, the establishment of a tree 2. Bintree output the results
erchashu
- 二叉树的各种遍历，用菜单形势实现的。前序中序后序层序-A variety of tree traversal, using the menu situation achievable. Preorder in sequence after sequence sequence
erchashu1
- 建造二叉树、二叉树的前序、中序、后序、层序遍历-The construction of binary tree, binary tree of the former order, in sequence, after the sequence, sequence traversal
Bitree
- 二叉树三种遍历的非递归算法（背诵版） 本贴给出二叉树先序、中序、后序三种遍历的非递归算法，此三个算法可视为标准算法，直接用于考研答题。 -Binary Tree Traversal three non-recursive algorithm (recitation version) gives the paste bintree first order, in sequence, after the sequence of three non-recursive traversal al
shu
- 编写程序，首先建立如下图所示的带头结点的二叉链存储结构二叉树，然后把二叉树顺时针旋转90度后在屏幕上打印该二叉树，然后输出分别按照前序遍历（含递归与非递归两种方法），中序遍历，后序遍历以及层次遍历等方法遍历二叉树次序访问各结点的序列信息，并验证结果正确与否，并实现在该二叉树中查找某结点数据的方法。-Programming, first of all to establish a lead as follows node chain store binary tree structure, and
bianli
- 所谓遍历(Traversal)是指沿着某条搜索路线，依次对树中每个结点均做一次且仅做一次访问。访问结点所做的操作依赖于具体的应用问 题。 -The so-called ergodic (Traversal) refers to a particular search along the line, followed on the tree each node are done once and only once to visit. Access node operation done de
INprinttree
- 凹入表的形式打印树 一先序遍历输入，把树转化成二叉树-Indentations in the form of a first print tree traversal input, the trees into tree
Binaryoperation
- 1．创建以二叉链表作存储结构的二叉树； 2．按前序遍历二叉树； 3．按中序遍历二叉树； 4．按后序遍历二叉树； 5．计算二叉树的单枝结点数； 6．按层次遍历二叉树。 -1. Create a list binary tree structure for storage 2. According to pre-order tree traversal 3. According to the binary tree traversal 4. After the tree
twotrees
- 二叉树的数据结构算法 包括二叉树的创建、遍历、输出等，可以作为课程设计的原材料-Binary tree data structure algorithms, including tree creation, traversal, output and so on, can be used as raw materials for curriculum design
Bittree
- 二叉树所有简单的功能，包括遍历的递归和非递归算法，值得学习研究哦！-Binary tree of all the simple features, including traversal of recursive and non-recursive algorithm, it is worth study, oh!
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
BST_path
- 二叉搜索树求每个结点到根节点的路径 非递归的先序，中序，后序遍历-Binary search tree for each node to the root path of the first non-recursive sequence, in order, after the traversal
TREE
- 树的基本操作实现。内容包括先序、中序、后序、层次遍历，树的深度等。-Tree to achieve the basic operation. Including first order, in sequence, after the order, the level of ergodicity, the depth of the tree.
establishment
- 二叉树建立与遍历源代码，这是我在大二时候做的实验报告，编译调试通过。-Binary Tree Traversal establish the source code, which is in his sophomore year when I do the experiment report, compiled through debugging.
BinaryTree
- 二叉树是另一种树形结构，它的特点是每个结点至多只有两棵子树，并且，二叉树的子树有左右之分，其次序不能任意颠倒。这个代码实现了二叉树的存储和遍历-err
TREE
- 二叉树的实现，包括前序、中序、后序和层次遍历，输出，计算叶子节点等函数。-Binary tree realization, including the former sequence, in order, after the traversal sequence and levels of output, computing functions, such as leaf nodes.
tree_find
- 中序线索化二叉树 实验<一>:构造二叉树，通过前序、中序\后序三种方法遍历此二叉树 实验<二>:构造线索化中序二叉树,查找此二叉树中某一结点的后继 -In order threaded binary tree experiment <a>: binary tree structure, through the pre-sequence, sequence after sequence of three methods of traversing t
migongsuanfa
- 将从迷宫入口到各点的最短路近的集合看作一棵树。用广度遍历 的方法即可找到出口的最短路近。本程序算法思想来源于求图上一点 到其余各点最短路近的Dijkstra算法。-Maze from the entrance point to the most recent collection of short circuit as a tree. Breadth traversal methods used to find the shortest path near exports. Algo
binarytree
- c++环境下的二叉树的构造，插入，删除，三种遍历的实现-c++ environment binary tree structure, insert, delete, traverse the realization of three
binarytree
- 二叉树的递归（先序，中序，后序）遍历，创建叶子结点数，二叉树深度-Recursive binary tree (first order, in sequence, after the order) traversal, create leaf nodes, tree depth