Data structure tutorial 4: Circular Queue explained and c program

preview_player
Показать описание
Circular Queue using array
Inserting elements into the circular queue
Deleting elements form the circular queue
Displaying elements of the circular queue

C program to implement circular queue
circular array
Implementing circular queue
array implementation circular queue
circular queue c program
Рекомендации по теме
Комментарии
Автор

the best data structue tutorial i till now found

devashishmanjhi
Автор

Superb
Superb Explanation...
I fully Understand the concept..
Thank you so much

akshaybhatia
Автор

awsome explanation... of logic and code too...ty :D

rupaprajapati
Автор

Superb explanation both the code and logic.

vivekmodi
Автор

Masterpiece ...Congratulations From Egypt :)
...
Fuck code school channel
you are the best

dotex
Автор

Yes its correct if you want to use for loop instead of while to display elements and after the if statement there should be an else block
else
{
for(i=front;i<=MAX-1;i++)
printf("%d ", cqueue[i]);


for(i=0; i<=rear; i++)
printf("%d ", cqueue[i]);
}

MarxtudorYT
Автор

i understood very well....thank u :)

lakshmixxful
Автор

Thanks a Lot Sir.Very Nice Explaination

devanandongole
Автор

your explanation is very well. Thank you very much!
Can you explain on Hanoi Tower using recursion?

titititi
Автор

thank you, i love your tutorial cause your explanations are soo good, please upload more videos and help us :)

zeeshiscanning
Автор

superb
concepts are
and the best part is each and every part of the code is explaind
in an excellent way :)
please sir can u upload tree and graph videos 
plzz sir its a due request
thanks once again  

gauravhiran
Автор

In insert function the last if/else can be simply replaced by one line of code below:
rear = (rear + 1)%MAX;

satishsinghal
Автор

u r so elaborative sir.thank u so much.please upload program of stack &queue implement usin pointers

anusha
Автор

Madhu Tk, The reason is because your c++ Header files are missing. Try to re install the program. I had the same Problem

superabhay
Автор

thank you sir. i am understood clearly

suresha
Автор

Wonderful, could u please make vid on Binary search trees :)

Shridhar
Автор

I need selection sort explanation please sir help me....I need coding link also for program ...u r explanation is awesome sir

maheakther
Автор

instead of the while statement in the display function, we can also do
if (front<=rear)
{
for (int i=front; i<=rear; i++)
printf ("%d", cqueue[i])
}

right??

zeeshiscanning
Автор

sir, please upload the video for binary search tree and josephus problem..please

prakharmishra
Автор

After continuous deletion iam getting garbage values, can any one help me

dhoni_dhoni-iuel