Sir this was such a useful class sir I have joined btech from diploma but I have changed my branch but the lectures not even saying the proper syllabus but you are gem among them it was truely helping sir thank you so much ☺️💯
Probably in the extreme right of the data store cell it will store the address of the second node and to the extreme left cell it will store the address of the last node
amazing lecture still helping us in 2024
Crystal doesn't even describe how clear this was. Thanks for the help !!
Sir this was such a useful class sir I have joined btech from diploma but I have changed my branch but the lectures not even saying the proper syllabus but you are gem among them it was truely helping sir thank you so much ☺️💯
Sir really your a life saver 🙌🏻
Thank you very very much sir
Very thank you sir. You are a great teacher.
Superb explanation sir.
thank you sir❤❤for providing such valuable content 🔥
Sir You saved my semester.. tommorow is exam 😢
Sir well done its very good that u have teach to us
thank you sir
Thank u sir from mayurbhanj odisha
Thank you sir.
Thank you so much.
Awesome teaching
sir then where will be the address of first node will be stored??
Explain with the algorithms it is quite easy
Very nicely explained👍
Sir just add implementation video of these concepts it will be helpfull
What will be in the circular double linked list in the first node null?
Nice explanation sir
499 G venkata konda reddy super sir
Environmental studies
Sir what Is circular double linked list?
Nice explanation sir...
456_Anurag chowdary.
Good morning sir/ iam k. Ramakrishna 461/very good and very nice to explanation sir /thank you sir
Amazing explanation 🫶🙌
Node one adress where will be stored?
Good morning sir,
474_p. Sreenath,
Nice explanation sir.
I like your explanation sir pdf upload chayande sir
Nagendra
__438
Super sir..
Sir,in first node what address it will store in the place of null in double circular linked list
Probably in the extreme right of the data store cell it will store the address of the second node and to the extreme left cell it will store the address of the last node
Nice video sir
Nice explanation sir
R. Abhilash reddy
20FH1A0481
Sir explain the insertion deletion searching in single linked list 🤔🤦♂️
Good morning sir
Syed Saddam Hussain (492)
Nice explanation sir
20FH1A04A0
Shahsiroyal
Nice explanation sir
Good morning sir D.Basha 448
Good morning Sir
C.Jaswanth (444)
20FH1A0488
S.Chandu Prasad
464 surya prathap reddy
20FH1A0495
pavan kumar reddy
Guru Nath Reddy.p
20FH1A0475
Nice Explanation sir
20FH1A0477
P. mahammad jameel
Good explanation
Nice explanation sir
S.MD.ASHRAF
20FH1A0485
Nice explanation sir
G NANDA KUMAR REDDY
20FH1A0449
K.HEMANTH RAO
20FH1A0457
NICE VIDEO SIR 👍
Good morning sir
Nice explanation sir
B.Venkata Rami Reddy
20FH1A0439
Thank you sir
Good morning sir
Rv Ganesh Reddy
20FH1A0480
Hi sir good morning sir 466_M.shabarisha
Good morning sir
M.Uday Kiran
20FH1A0468
20FH1A0469
M PAVAN KUMAR GOUD
GOOD SIR
20FH1A0451
K.GANESH
Hi good morning sir
20FH1A0458
K.SAIKUMAR
Super explanation sir
Thank you sir
Good morning sir
484_s.mansoor