搜索资源列表
erchashu
- 采用二叉链表作为存储结构，完成二叉树的建立、前序、中序、后序和按层遍历的操作，并求出二叉树的高度、所有叶子及树结点总数的算法，输出二叉树的广义表表示-List using the binary storage structures, the establishment of complete binary tree, the former order, in order, the order and by level traversal of the operation, and calcula
tree
- 关于二叉树的一些操作，包括建树，先序、后续、中序、层序非递归遍历等-Some operations on the binary tree
fwd3
- 利用C++语言，实现二叉树的遍历，前序中序后序，层序，递归非递归-Using C++ language, to achieve binary tree traversal, pre-order in the sequence after sequence, sequence, recursive non-recursive
lx
- 完成二叉树的基本算法，包括二叉树的生成（多种方式，先根、层次、双序列），遍历（前序、中序、层次等），求叶子节点数等-Completion of the basic binary tree algorithm, including the generation of binary tree (a variety of ways, first the root, level, two-sequence), traversal (pre-order, in sequence, level, etc.)
Binary-Tree
- 本程序实现了对二叉树的前、中、后和层序的遍历-The program realization of the binary tree before, during, and after the traversal sequence
tree
- 二叉树的中序、前序、后序的递归、非递归遍历算法，层次序的非递归遍历算法的实现-Binary tree in order, first order, the order of the recursive, non-recursive traversal algorithm, hierarchical sequence of non-recursive traversal algorithm to achieve
BTree
- 二叉树的四种遍历结果，各结点层序输出，计算各结点总数，找一种遍历结果中第n个结点的双亲结点，孩子结点和第几个位置的结点。-The results of the four binary tree traversal, each node sequence output, calculate the total number of nodes, find a loop through the results of the first n nodes of parent nodes, child no
tree
- 二叉树的先序，中序，后序，层序的递归，非递归遍历-Binary tree preorder, inorder, postorder, the sequence of recursive, non-recursive traversal
erchashu
- 创建二叉树、遍历（先序、中序、后序、层序）、计算（结点数、叶子数、高度、宽度）、查找（找结点、找双亲、找孩子、找兄弟，找祖先）、判断（二叉排序树、平衡二叉树、完全二叉树）、处理（左右子树互换，销毁、删子树、插子树、复制)等功能-Create a binary tree traversal (first sequence, sequence after sequence, sequence), calculated (number of nodes, number of leaves, heigh
Binary-Tree
- （1）实现二叉树的构造过程，并打印出二叉树 （2）对该二叉树分别用层序、前序、中序和后序四种不同的方法进行遍历； （3）将该二叉树的所有左右子树进行交换，得到新的二叉树，并打印出该二叉树； （4）对新获得的二叉树分别用层序、前序、中序和后序四种不同的方法进行遍历。-(1) the construction process to achieve the two fork tree, and print out the two fork tree
BinaryTree
- 输入一个二叉树，进行前序、中序、后序的遍历，同时计算树的深度，查找所要查找的结点的层数。-build a binary tree, to do the traverse in different ways and calculate the depth of the tree.