Data Structures
•Linear Arrays...
–direct access (insert
at the “rear” position, remove at “front”
position)
–extreme problem:
rightward drift
–as data is inserted
and removed it slowly drifts to the right; soon
the ‘queue’ may seem empty but yet there is not data!
–alternating enqueues
and dequeues will cause this disastrous
result...
•