Queue Data Structure implementation using Array - C++

preview_player
Показать описание
To implement queue data structure using array and create a program/code in C++ to understand how we can implement the logic in our code and create a queue using array data structure and make enqueue / insertion & dequeue/deletion functions.

0:00 What is a Queue?
0:24 Queue Operations
0:45 Create Queue using Array & isemplty() function
1:30 Enqueue Method - Add element to Queue
4:00 Dequeue - Remove element from Queue
5:39 Show Front most Element
5:52 Display Queue method
6:12 C++ Code for Queue using Array

-------------------------------Source Code ----------------------------------

-------------------------------Support Us ------------------------------------

-------------------------------Like on Facebook ------------------------------

-------------------------------Follow on twitter --------------------------------

#queue #array #datastructure #queueusingarray #insert #delete #enqueue #dequeue #codewhoop
Рекомендации по теме
Комментарии
Автор

Such a good explanation. One day when I will get a job, I will definitely give my Guru Dakshina to you. I will never forget how you taught me without any cost in a world where even a glass of water has a price. You are doing a great service to students all around the world.

soubhiksen
Автор

Keep making these short and super effective videos, u will have million subs one day

shilpimitra
Автор

Thank you so much! Please keep making these videos.

teresalizaola
Автор

Thanks short and clear really appreciate!!!

MrAlikdv
Автор

a soothing voice and good animation is all you need to grasp any topic

viditsharma
Автор

Very nice code example, it helped me a lot. Thank you.

hauteswan
Автор

Just great. a very simple and effective code. and very useful!
just keep teaching us! your are a genius.

jeanmmm
Автор

Thank you 😇😇for explaining in such a beautiful manner🤩

HadiaAkram-jyno
Автор

understood very well, keep making like these videos

anushagururajan
Автор

Such a good explaination. Thankyou so much

pjtvgot
Автор

thanks a lot, , , this is nice implementation with good presentation

md.robelahammed
Автор

thank you much i am really so grateful for u

qphhkbe
Автор

best way one can explain....great job, keep it up.

anshulloach
Автор

Very excellent explanation keep doing and start python it will definitely increase u r channel pride and subscribers...

pavankumar
Автор

you have quite heavy indian accent but other than that, clear explanations and simple video

MrKibujo
Автор

can you post videos on breadth first search and how to apply it in problems

graju
Автор

Why do you increment front while you increment rear?
We should increment front while we dequeue.

mohammadyounusmohib
Автор

hey! great video!

void enqueue(int value)
{
if(rear==size-1 && front== 0)
cout<<"queue is full"<<endl;
}

why there is only rear==size-1 on the video ??

stevenking
Автор

the output of this program is empty WHYYY???\

rameezraja
Автор

But y don't u upload more videos.bro

saikirandurgam