搜索资源列表
erchashu-c
- 二叉树所有操作的c程序，包括建立，插入，遍历，删除等等，已经通过调试-C binary tree of all operations procedures, including the establishment of, insert, traverse, delete, etc., have been through debugging
C_TREE
- 本例题将介绍一种建立二叉树的算法。同时介绍对“遍历算法”灵活应用：将二叉树中每个结点的左右子树进行交换。介绍求二叉树深度的算法。 二叉树的建立是一个递归方法，与二叉树先序遍历思路有点相似。数据的组织是先序遍历的顺序，但是当某结点的某孩子为空时以数据0来充当，也要输入。结合右图的二叉树，其数据的输入顺序应该是： 1 2 4 0 0 0 3 5 0 7 0 0 6 8 0 0 9 0 0。 若当前数据不为0，则申请一个结点存入当前数据。如果输入0表明是空（NULL），不分配结点。递归调用
bianli
- 遍历二叉树 是指以一定的次序访问二叉树中的每个结点，并且每个结点仅被访问一次见图-Binary tree traversal refers to a certain tree in order to visit each node and each node has been visited only once see Figure
binary_tree
- 二叉树三种遍历的非递归算法 给出二叉树先序、中序、后序三种遍历的非递归算法，此三个算法可视为标准算法，直接用于考研答题。-Binary Tree Traversal three non-recursive algorithm
deepLook
- 深度遍历一个二叉树，以读取结点的有关信息-read the data the connection of the two tree in a deep looking way
wideLook
- 为了读取二叉树的结点数据，广度遍历二叉树-Read the information of the connection of the two tree in a wide Looking way
paxieeuew
- 1.创建二叉树 2.输出二叉树 4.二叉树的前中后三序遍历 5.删除特定关键字结点 0.退出程序-1. Create a binary tree 2. Output binary tree 4. Bintree three after the first traversal of 5. Delete specific keyword node 0. Exit procedures
LevelVisit
- 我们了解二叉树的前序,中序和后序遍历,那么设计一个程序实线二叉树的层次遍历-We understand that the first order binary tree, in sequence and post-order traversal, then design a program of line-level binary tree traversal
1
- 建立二叉树 中序遍历二叉树算法 计算二叉树的节点-Set up tree traversal in binary tree algorithm binary tree node
abinarytree
- 求二叉树树高，和把由前序和中序构建树，又后序遍历这两步放在同一个递归中完成的两个程序。-Binary tree for tree height, and put by the former sequence and in order to build a tree traversal sequence after another on these two steps completed by the middle of the same two recursive procedures.
tree
- js解析xml文件，涉及到遍历树及节点。 是非常有用的html工具-javascr ipt and xml
Bitree
- 实现二叉树遍历的Visual C++程序，要求输入二叉树的各结点后可以算出其三种遍历，即先序，中序，后序。-Binary Tree Traversal implementation of the Visual C++ procedures for the importation of all tree nodes can be worked out after its three ergodic, that is first order, in sequence, after the seque
Binarytree
- 二叉数的基本操作源码，包括创建二叉树，先根、中根、后根遍历二叉树等等操作。-Binary source code a few basic operations, including the creation of binary tree, the first root, root, root binary tree traversal operation and so on.
BiTree
- 二叉树的创建，中序，先序，后序，层次遍历-Binary tree creation, in sequence, first sequence, the latter sequence, the level of ergodic
tree
- Windows操作系统下用C语言实现的树的一些算法，遍历、统计、连接等。-Windows operating system using C language implementation of a number of tree algorithms, traversal, statistics, connections and so on.
XMLReadWrite
- 一个对简单的XML文件进行的程序，里面包含了对文件的读写和多叉树递归遍历。-A simple XML file for the procedure, which contains the document to read and write and many Recursive quadtree traversal.
SimpleBinaryTreeExample
- 创建二叉树，添加元素，删除元素 ，遍历这棵树 ，重设树的大小，增加和消减， -Simple Binary Tree Example。
twotree
- 二叉树的基本操作，包括建树，查询，遍历等。-Binary Tree' s basic operations, including contribution, query, traversal and so on.
Binarytreeforthewidth
- 求二叉树中的宽度 二叉树中具有结点数最多的那一层结点总数即是二叉树的宽度。可以采用分层遍历的方法求出所有结点的-Binary tree for the width of tree nodes with the largest total number of nodes that a layer that is the width of tree. Layered traversal can be used to derive all the way to node
TreeTraversal
- 已知二叉树的先序、中序遍历的结果，构造出该二叉树，并用非递归的后序遍历算法遍历该二叉树-Sequence of the first known binary tree, traversal of the results of the binary tree structure, and after the use of non-recursive traversal of the binary tree traversal algorithm