The.Algorithm.Design.Manual.Springer-Verlag.1998

Lecture 7 - elementary data structures
All are O(1) time operations.
Listen To Part 7-7
if STACK-EMPTY(S)
then error ``underflow''
else
Queue Implementation
return S[top[S] + 1]
A circular queue implementation requires pointers to the head and tail elements, and wraps around to reuse array
elements.
ENQUEUE(Q, x)
Q[tail[Q]] x
if tail[Q] = length[Q]
file:///E|/LEC/LECTUR17/NODE7.HTM (4 of 13) [19/1/2003 1:34:41]
then tail[Q] 1
else tail[Q] tail[Q] + 1