本章重点介绍了抽象数据类型，包括线性列表、栈、队列的操作及其实现方式。栈的push和pop操作，队列的enqueue和dequeue操作分别可能导致溢出和下溢状况。此外，还对比了深度优先和广度优先遍历的区别，以及网络作为带权重图的概念。
计算机科学导论第12章参考答案.pdf
CHAPTER 12
Abstract Data Types
Review Questions
1. An abstract data type is a data declaration packaged together with the operations
that are meaningful for the data type with the implementation hidden from the user.
3. A linear list is a list in which each element has a unique successor.
5. Two common implementations of a general list are an array and a linked list.
7. A push operation adds an element to the top of the stack while a pop operation
removes an element from the top of the stack. A push can put the stack in an over-
flow condition while a pop can put the stack in an underflow condition.
9. The enqueue operation adds an element to the rear of a queue. The dequeue opera-
tion removes the element at the front of the queue. The enqueue operation could
put the queue in an overflow state while the dequeue coul
最低0.47元/天 解锁文章
扫一扫
1890
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
