文件名称:shiyan
介绍说明--下载内容均来自于网络,请自行研究使用
通过对栈的特性的应用来实现顺序出栈。
1,2,3,4按顺序进栈,但有各种不同的出栈方法。本实验举出它们所有的出栈顺序,以及按进栈顺序出栈的排列及从栈顶开始出栈的排列。-Through the application of the characteristics of the stack in order to achieve a stack. 1,2,3,4 in sequence into the stack, but there are different ways out of the stack. In this study, they all cited the stack order, and according to the order of the stack into the stack arrangement and start from the top of the stack the stack arrangement.
1,2,3,4按顺序进栈,但有各种不同的出栈方法。本实验举出它们所有的出栈顺序,以及按进栈顺序出栈的排列及从栈顶开始出栈的排列。-Through the application of the characteristics of the stack in order to achieve a stack. 1,2,3,4 in sequence into the stack, but there are different ways out of the stack. In this study, they all cited the stack order, and according to the order of the stack into the stack arrangement and start from the top of the stack the stack arrangement.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
新建文件夹
..........\shiyanwu haxibiao.doc
..........\实验三 实现二叉树的遍历方法.doc
..........\实验二 实现顺序栈或循环队列的存储 .doc
..........\实验六 实现希尔插入排序.doc
..........\shiyanwu haxibiao.doc
..........\实验三 实现二叉树的遍历方法.doc
..........\实验二 实现顺序栈或循环队列的存储 .doc
..........\实验六 实现希尔插入排序.doc