文件名称:project7
介绍说明－－下载内容来自于网络，使用问题请自行百度
利用构造完全二叉树的方法建立二叉树结构。(1)
实现二叉树的先序、中序、后序遍历以及求深度操作；(2)
利用堆栈进行中序遍历并指出栈内最多元素个数。(The structure of binary tree is established by constructing complete binary tree.
To realize the traversal of the binary tree in order, in order and after order and to find the depth operation;The stack is used for intermediate traversal and the number of the most plural elements in the stack is pointed out.)
实现二叉树的先序、中序、后序遍历以及求深度操作；(2)
利用堆栈进行中序遍历并指出栈内最多元素个数。(The structure of binary tree is established by constructing complete binary tree.
To realize the traversal of the binary tree in order, in order and after order and to find the depth operation;The stack is used for intermediate traversal and the number of the most plural elements in the stack is pointed out.)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| p7.cpp | 2353 | 2019-04-18 |
| 可执行文件.docx | 14459 | 2019-04-18 |
| 数据结构第七次作业报告.docx | 62315 | 2019-04-18 |
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。