搜索资源列表
jianshu
- 建立二叉树,实现二叉数的遍历和查找结点,输出结点值等-establish binary tree, few realized the two forks traverse and search node, the output node value
BitTree
- 二叉树的几种操作，包括递归先序建立二叉树、先序遍历、中序遍历、后序遍历、非递归的各种遍历、计算叶子节点数目和所有节点数目，使用队列实现层次遍历。供研究和学习基本算法者使用
erchashudejianliyubianli
- 程序运行时，先输入二叉树结点的值（一个字符），先建立二叉树，然后对建立的二叉树分别进行先序、中序、后序遍历；要求格式化输出遍历结果：每一序列数据之间用“—〉”分开，三种遍历结果应该分行显示；输出结果之前最好给出提示，如：“InOrderTraverse：”。
13094056703
- 一些经典CC++程序源码 1、 运动会分数统计** 2、 订票系统 3、拓扑排序4、 迷宫求解5、 文章编辑**6、 joseph环 7、 猴子选大王**8、 建立二叉树，层序、先序遍历（ 用递归或非递归的方法都可以）**9、 赫夫曼树的建立 10、 纸牌游戏**11、图的建立及输出
asdasda
- 二叉树的一些算法实现，包括建立、判断、遍历等
btree
- 二叉树的建立，前序遍历，中序遍历及层次遍历-Tree establishment, pre-order traversal, in order traversal and traversal level
bitree_operation
- 二叉排序树的建立，也包括二叉树的遍历程序，有多种处理二叉树的功能。-Binary sort tree establishment, but also of the tree traversal process, there are several functions to deal with binary tree.
BSTree_operate
- 二叉排序树的建立和遍历的程序，里面有多种遍历的方法，可以满足不同的需要。-Binary sort tree traversal of the establishment and procedures, there are a variety of ways to traverse to meet different needs.
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
BiTree
- 建立一棵含有n个结点的二叉树，采用二叉链表存储, 前序（或中序、后序）遍历该二叉树。 -Create a binary tree with n nodes, using a binary linked list storage, pre-order (or sequence order) traversal of the binary tree.
include
- 线索二叉树 建立中序线索二叉树，并且中序遍历 求中序线索二叉树上已知结点中序的前驱和后继-Binary tree in order to establish clues clues tree, and in the traversal sequence for clues in the binary tree nodes on the known sequence of the precursor and follow-up
traversal-of-binary-tree
- 二叉树的建立，对于电网模型层次结构实现遍历搜索-traversal of binary tree
tree
- 树的相关操作，先序遍历建立二叉链表，左右孩子交换，二叉树中叶子节点个数算法，统计以值为x的结点为根的子树中叶子结点的数目，按树状打印二叉树-Tree-related operations, first traversal establishment of binary list, so the child exchange, the number of leaf nodes in a binary tree algorithm, the statistical value of x to a n
ff
- 建立二叉树；对其进行遍历，遍历过程中输出结点的值；求出该二叉树的高度；并查询二叉树中是否 存在值为x的结点。 -Establish binary tree its traverse, the output node during the traversal value determined the height of the binary tree and query the existence of a binary tree node value is x.
project8.tar
- 由双亲表示法建立3棵树，将这些树表示的森林转换成二叉树，对二叉树进行线索化并遍历。-Law established by the parents said three trees, these trees will be converted into a binary representation of the forest for clues and binary tree traversal.
project
- 利用构造完全二叉树的方法建立二叉树结构，并实现二叉树的先序、中序、后序遍历以及求深度操作。 例如：依次输入字符ABCDE#F##G####H-Constructed using methods established complete binary tree binary tree structure, and to achieve binary tree preorder, inorder, preorder, and the depth of the operation. For
er-cha-shu
- 定义二叉链表类型，实现二叉树的基本操作：建立、先中后序遍历、层次遍历及输出。-The definition of two fork list type, two fork tree to achieve the basic operation: the establishment, the first in the order traversal, hierarchical traversal and output.
16012407Exp1
- 建立一个二叉树，根据指令遍历二叉树，并输出二叉树的深度等信息。-The establishment of a binary tree, the binary tree traversal according to the instruction, and outputs the binary tree of depth and other information.
有序二叉树
- 有序二叉树的各种功能，遍历 删除 建立 等等(ordered two folk tree)