circular queue in data structure in hindi | Niharika Panda

preview_player
Показать описание
circular queue in data structure in hindi
Рекомендации по теме
Комментарии
Автор

front should be equal to front+1, for deletion

megaraina
Автор

Front=front-1 ..how it is possible please answer...as far as i know front=front+1 happens for deletion and when rear =max size-1...then only front becomes 0 instead of incrementing

utsavpatra
Автор

Concept is not clear, because mam is confused it’s topic 😂😂

Jitubhaiya-qqrh
Автор

Mam tell me agr HM without head queueu implement kry to

annnycreations
Автор

I think at deletion time front will increase by 1.

sujalbalar
Автор

Koi baat ni insn hai glti ho jati h keep it up mam your voice and method was awesome. But next time jab b record krien to thora sa carefully ho k

hadi.uetian
Автор

4:04 me bell ring kiya, plz za ker dekhiye koi aaya hoga... (:-D)

VishalKumar-vwmg
Автор

Dear Mam can you send me the pdf file of the whole DS notes ? your way of teaching is awesome.

bjutzdramaclub
Автор

tomorrow will be my exam... but lit mam your voice is very calm and awesome.

chiragjain
Автор

Report guys agr smj naa aaye aur lage ki inhe khud pdhna chiye

Chaitanya_sariyal
Автор

5.10 mai app ka jo (iii) rule hai wo galat hai
rear =rear+1;
Hoga tik se dekhey plz app bohot galat para rahe hai

aniketmondal
Автор

Mujhe maf kre mujhe jane de.. Aap rehne de na kre aap..

rohitshrivastavdotcom
Автор

Mam aaap khud smjh lo phle fir aana youtube me pese chapne chapri. Log bc khud aata ni pdhane aa jaate hai

Chaitanya_sariyal
Автор

phele mam khud pdh liya karo tab padhaya karo

BCDCGaming
Автор

video dubara bna leta na itne mistake krni the to 🙏

nikhilkohli
Автор

bibi pehle khud parh ley phir dusrun ko parhayey... wasted my time

ZeeshanAli-lr
Автор

Pehle sikh kar aao madam fir yha sikhana.

priyadarshisharma