基于数组栈与队列实现及扩容策略.pdfVIP

Today’sannouncements:

MP4available10/1,ECdue10/7,11:59p,regularsubmissiondue10/14,11:59p.

Exam1returnedinsectionnextweek.

Today:

Stacks

Resizingarray-basedlinearstructuresQueues

Stackarraybasedimplementation:

Stackarraybasedimplementation:(whatifarray

fills?)

AnalysisholdsforarraybasedimplementationsofLists,Stacks,Queues,Heaps…

GeneralIdea:uponaninsert(push),ifthearrayisfull,createalargerspaceandcopy

thedataintoit.

Mainquestion:What’stheresizingscheme?Weexamine3.

Stackarraybasedimplementation:(whatifarrayfills?)

Stackarraybasedimplementation:(whatifarrayfills?)

Stackarraybasedimplementation:(whatifarrayfills?)

Summary:

Linkedlistbasedimplementationofastack:

Constanttimepushandpop.

Arraybasedimplementationofastack:

timepop.

timepushifcapacityexists,

()()

CostoverpushesisforanAVERAGEofperpush.

()

1

Whyconsideranarray?

10xfaster

dephunicingptiois

Queues:linem构造daccessstruc-

exit

3

∴=

11

Head

temte

classQueue{

public:

//ctoradtor

boolempty()const;

voidenqueue(constSITe);

SITdequeue();

private:

structqueueNode{

SITdata;

queueNode*next;//+ctor

1

queueNode*entry;

queueNode*exit;

intsize;

上

Whichpointeris“entry”andwhichis“exit”?

tail

Whatisrunningtimeofqueue?

0(1)

1()

11→et

Whatisrunningtimeofqueue?

O(1)

()

1,0

Queuearraybasedimplementation:

temtecla