搜索资源列表
bttree
- 用汇编语言编写的二叉树,可实现前序遍历,中序遍历,后序遍历-assembler language of binary tree, can be realized before the preorder, preorder, after preorder
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
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.