数据结构第三章栈和队列3习题.pdf
版权申诉
58 浏览量
2023-07-29
23:03:16
上传
评论
收藏 94KB PDF 举报
1
2. n
top
A. top++ ; B. top -- ;
top ==n
C. top = 0
A. 3, 2, 1 B. 2, 1, 3 C. 3, 1, 2
4.
A. B. C. D.
5. n
A. n-2 B. n-1 C. n D. n+1
6.
A. B.
C. D.
1.
A.
B.
C.
D.
3. 1,2,3
D. top
D. 1, 3, 2
7.
front rear
A. front+1 == rear B. rear+1 == front
C. front == 0 D. front == rear
8.
A. front == rear C. rear != NULL
front rear B. front !=
NULL
D. front == NULL
9. data, link
s A.
top->link = s ;
C. s->link = top ; top = s
top
B. s->link = top->link ; top->link = s
D. s->link = top ; top = top->link ;
10.
data, link top x
A. x = top->data ; top = top->link
C. x = top ; top = top->link
B. top = top->link D. x
= top->data
x = top->data
11.
#define MaxSize 100
typedef int ElemType typedef
struct {
资源评论
