搜索资源列表
binarytree-bianli
- 从键盘输入9个字符F B A D E C H G M。 • 查找结点E，并输出该结点的指针。 • 前序、中序和后序遍历输出该二叉树。 -input from the keyboard characters F 9 A B C D E G H M.
bttree
- 用汇编语言编写的二叉树,可实现前序遍历,中序遍历,后序遍历-assembler language of binary tree, can be realized before the preorder, preorder, after preorder
yyh
- 对二叉树的生存,二叉树遍历等,有前序的,中序的,后序的,层次的,求结点数的等.
binarytree
- 用汇编写的二叉树遍历程序包括前序，中序，后序遍历。-was compiled using the binary tree traversal procedures including the former sequence, sequence, after the preorder.
binatree
- 汇编实现二叉树遍历,数据结构的前中后序遍历-compilation achieve binary tree traversal, data structure before, during and after the preorder
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
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.
BiTree
- 二叉树的构造和遍历,其中包括前序、中序、后序、层序遍历-The construction of bitree
4_18
- 二叉树的前中后序遍历层次遍历，以及求节点数高度。求节点的父节点-Before, during and after the binary tree traversal hierarchy traversal, as well as the number of nodes required height. Find parent node