搜索资源列表
876753673
- 实现前序遍历四层二叉树,程序有操作提示、输入和输出，界面追求友好。-realize the former preorder four binary tree, operating procedures suggest that input and output, and the pursuit of friendly interface.
end
- 二叉树-binary tree ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
lxshu
- 用汇编语言编写的二叉树排列算法，我自己的汇编课程设计之一-assembler language with the binary tree algorithm, a compilation of my own design one of the courses
btree2
- 实现输入二叉树并对它进行先序中序后序遍历-achieve input binary tree as well as its first order for the order after the preorder
bttree
- 用汇编语言编写的二叉树,可实现前序遍历,中序遍历,后序遍历-assembler language of binary tree, can be realized before the preorder, preorder, after preorder
binarytreetranverse
- 用汇编实现二叉树的遍历,提示输入左右子树显示结果-compilation of achievement with the binary tree traversal, suggesting that the importation of sub-trees around results show
tree
- You can see some basis operation on the binary tree.There are some very easy content of data structure.
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
基于二叉树求算术表达式求值的课程设计
- 这是本人做的关于基于二叉树求算术表达式求值的课程设计，供大家一起学习。表达式求解问题 设计一个程序实现基于二叉树表示的算术表达式的操作。 1、 需求分析 1. 算术表达式的合法输入数据包括变量（A~Z,a~z）、常量（0－9）和二元运算符（＋，－，＊，／，^（乘幂））。程序对数据输入格式不作要求，用户需自己保证语法正确，详见用户手册说明。 2. 演示程序以人机对话的方式执行，即在计算机上显示提示信息后，由用户在键盘上输入对应的数据或命令，程序将执行相应的操作并显示下一步信息。 3. 程
depth
- 构造二叉树，并求叶子节点的个数和该二叉树的深度。-Construct a binary tree, and find the number of leaf nodes and the binary tree of depth.
BiTree
- 1.构建二叉树 2.编写递归算法，交换二叉树的左右子树； 3.输出按先序遍历得到的新二叉树结果。 -1 build a binary tree 2 write a recursive algorithm, exchange the left and right binary subtree 3 preorder traversal of the output obtained by a new binary tree results.
ERCHASHU
- 关于二叉树的一些基本操作，包括查找，添加，删除结点-About some of the basic binary tree operations, including search, add, delete node and so on
c1
- 平衡二叉排序树的设计与实现C语言源程序代码-Balanced binary tree to sort the design and implementation of C language source code
3
- 用汇编语言实现二叉树输入和遍历~ 河北理工大学 吴亚峰-Assembly language input and the realization of binary tree traversal
tree
- 是二叉树，希望能帮到你，可以帮到你对你有用-Is a binary tree, hoping to help you, can help you be useful to you
-binary-tree
- 本文介绍了二叉树的定义、性质及存储方式，各种遍历算法。 以及求所有叶子及结点总数。-This article describes the definition, nature and storage of binary tree, various traversal algorithm. And the demand of all the leaves and the total number of nodes.
traversal-of-binary-tree
- 二叉树的建立，对于电网模型层次结构实现遍历搜索-traversal of binary tree
tree
- 数据结构二叉树，让你轻松掌握数据结构核心知识-Binary tree data structure, data structure allows you to easily master the core knowledge
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