Data Structures Using C++: STL Queue Class

preview_player
Показать описание
Concepts:
How to use the STL Queue class
Operations: push, pop, empty, size, front and back
Рекомендации по теме
Комментарии
Автор

You did a great job explaining this. Absolutely no complaints. Very comprehensible, the information was presented in an organized manner, you seemed like you cared, you were clear, and not boring at all. Thank you lol

HunterHunter
Автор

Very good illustration! Thank you, sir!

PinkChineseChives
Автор

this is really helping me out, simple and easy to understand. thanks again

Riane
Автор

Thank you for explaining this, it really helps.

vasilijesepecan
Автор

Thank you very much for this explanation

emeliorecords
Автор

What is your take for the algorithm on this? What are your checks? If your try to pop() when front and back are equal, what is your condition there? What about pushing more than what is intended? How do you reallocate that space? You have to cover all the circumstances and that's what my hang up is.

hotdogjoe
Автор

Is there a way on how to delete(pop) a queue's back / front and back at the same time ??

juliuscalderon
Автор

Hi, i'm doing a programm with c++, that manages the inputs into stadiam.
For every person we must have (name, surname, date of birth and numbers of arrive)
[this is a struct];
We must make for queues...
Can you help me?

adrianoc
Автор

what's the difference between queue<int> and int queue;

teheemikmik
Автор

Dude, how i can erase specific element from queue????

logvedio