Queues TheQueueA collection of " that " container A - - PowerPoint PPT Presentation
Queues TheQueueA collection of " that " container A stores a insertion and removal in with items " first - in - first - out " order . push pop 49 Stack : -1% Queue : & : : : degueae engaeae Basic
Queues
TheQueueA
A
"container " thatstores
a
collection of
items
with
insertion and removal
in
" first - in - first - out
"
push
pop
49
Stack : -1% Queue :
: : :
degueae
④
engaeae
Basic operations :
enqueue
:add
an item
to the
back of
the list
degueue :
remove
an item from the
front
list .
Example : Palindrome Checking
.aba
aab
✓
×
In
an array
: IT
i
i
j si
with
a
stack
and
queue
:
each
in
a
stack
and
a
queue
..
%:*:
em
+ deqve
an
element from the
queue
.z
.if different → nota
palindrome .
Queuejhinkedhisttmplemewtatim-ba.ie ,
Enquire
: add
a new
node to the
Degueue
: remove the
' front' element
front
→FIFTEEN
backD-
°Engue
f-t.tt#-oFHYeTy.-HdTd*-ij
b.htretap
Variables
: forget } pointers to
nodes
.size
: #elements
in the queue
.NodeTypg has variables data
4 next
engueuelx){
n←newnodecoutamg£
dd it to the
list
back←back⇒nT
}
size
= street In
front
' Drops . . .back
C){ ×✓
temp a- front
← front⇒data
e- front-onext
temp
site
}
← empty queue
enaoueue a
FP9R
Ip
queue
is :
c.die
engweeeebf.ph#enqueoeep-j
KID
enqueue
a f¥¥
rtft
1-1
.
engulf
degueue I
engage#
1¥11
f- 4
* r
degree ft
tr
engined by
degree £-1
H f 't
ft Pr
front
back
%
front
back
Longman
K
"
front
. " JackI
goes
to :
back II. front
{ degree twice
Variables
: arrayA ← array
size capacity
front ←
size
← o
capacity
← ?
A [ back % capacity
I*X
Site t= 1
A [ back] ← ×
back = backthe
site
= size t Ie (back t 1)
% capacity
.}
degueve.DE
temp ← Affront] front
← front
t 1) % capacity site
← site
}
return temp
F-rid