Video 6 of a series explaining the basic concepts of Data Structures and Algorithms. This video explains the basic concepts behind additions and deletions from the data structure queue. This video is meant for educational purposes only.
Pls mam give a solution for question with detailed explanation The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
