Question: An ordinary queue is a first - in , data structure root out empty out last out first - out
An ordinary queue is a firstin data structure
root out
empty out
last out
firstout
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
