Circular Queues - Additions and Deletions

Video 12 of a series explaining the basic concepts of Data Structures and Algorithms.
This video explains the pseudo code for additions into, and deletions from a circular queue.
This video is meant for educational purposes only.

[@selvat9414]

Super awesome!!!! Continue your work you deserve it

[@ChristianCaldera87]

Great videos!

[@sivakrishna5293]

Simple and Clean explanation, Thanks.

[@dharmarajapazhani9962]

awesome, explanation as an elegant way

[@sohamchakraborty4219]

Thank you ma'am.It was really helpful

[@curious_1401]

Thanks🙏 Video was really helpful

[@rajpreettrippy4996]

very good explanation

[@prithvigupta8215]

If(f==(r+1%size)) then queue full

[@danisgadkari8053]

Wow great

[@ruchad31]

rear=++rear%len is correct

[@jiaweitang2879]

thank u, very helpful. but shouldn't the delete function clear the array element (set it to zero), otherwise it has not really been deleted?