Stacks Stack - a collection of ADT objects that stores - - PowerPoint PPT Presentation
Stacks Stack - a collection of ADT objects that stores Insertions 4 removals follow a n . Last - in - first - out pattern < Basic Operations : ' ' top an element at the inserts push : removes t returns the top .
that
stores
a collection of
Insertions 4 removals follow
a n .
Last- in - first - out pattern
< Basic Operations:
push
:
inserts
an element at the
'
'
pop
:
removes t returns the top
. element
⇐
'
empty
stack
isEmpty
:
check for emptiness
n .
size :
return
#
elements
top
:
return top , but don't remove it
. parsing levaluat.com/transformation of expressions
coding(decoding
network access control
. → programming languages £ executionthe call stack
we do daily with computers
. . .
00 ⑨ a
0 0
@ 0
a 0 •
a
a @ eg b @
×
Can be done by counting
:
1
2
4 23
2 10
12 I 21
1
01
0 -7
Checking Multiple Grouping Symbols
:
pp
not
enough
. empty
stack
while
there
are
symbols
to read
C ←
next
symbol
if
e
is
a
left
symbol
push
con
S
else
S
is empty
report
error d * pop
S
do
not match report
end
while
5
is
not
empty
report
error
report
" ok
"
'
top
is empty
Alot
A
pacify
A
= !⇐
capacity
= {size of A)
top
= 2
push
e
A-tT}
=
capacity
= {size of A)
top =3
3
= ±f
Which end shout
be the top ?
= insert
at top
= front of list = normalI linked
list
add - to - front
.pop
= remove from front
= top .
= normal linked list
remove
b-
both
cases ,
push
4
pop
are
constant time
as the
stack does not get
larger
than
the
array ) .