i nearly wasted half-day by listening other lecture videos(linked list) and learned nothing ,confused alot, but after listening to your lecture i got full clarity on linked list.thank you sir
@amankeshri38233 жыл бұрын
Same here , I wasted 2 days 😅
@AbdulMuqsith-xr3dh5 ай бұрын
but i wasted 10 days
@labanidas43183 жыл бұрын
Very easy explanation for absolute beginners. I wasted my whole day learning linked list from others videos but learned nothing and got confused. You clarified everything so easily . Thank you sir.
@vivekanandkhyade3 жыл бұрын
Thanks Labani for appreciating
@gaaty19544 жыл бұрын
Informative. Instead of assuming we know all the basics, you explained functions of each code NICEEE! Keep up the good work.
@rahullegendboy902 жыл бұрын
Ab jakr koi video mili jism linked list k hr point ko describe krk btaya ....thank you so much sir
@jimmys86855 жыл бұрын
Sir,you are truly mind-blowing Earlier I used to see mycodeschool videos but they have stopped uploading a long time ago... You are a the best sir
@patil88ganesh5 жыл бұрын
The founder of mycodeschool is no more in the world :( He met with an accident. Hence no videos.
@samarthsudarshan48685 жыл бұрын
@@patil88ganesh how did u find that out??
@Irshadkhan-ht7yj5 жыл бұрын
sir i am from Pakistan this video lecture helps me a lot in data structure so it is humbly requested to give such type of lecture on each data structure instead of only explaining algorithm codes explanation helps the students a lot. thank you sir for this lecture and uploading its program.
@worldoffootball185 Жыл бұрын
very good teaching sir no one can explain this topic in the youtube
@richashree33452 жыл бұрын
great explanation sir....thank u very much💯
@anilreddypinreddy44574 жыл бұрын
Clear explanation with good information tq 👍 sir .......
@creationcenterTV5 жыл бұрын
Can you turn this into a series? Maybe you could do doubly linked list next and move onto more and more complex data structures you cover in the other videos
@CaptWindShear2 жыл бұрын
Nice and relaxed, easy does it teaching. As good as it gets, many thanks!
@katariyaarchita4306 Жыл бұрын
Very well explanation!
@supriyajyoti222 жыл бұрын
Thank u sir for such a wonderful video
@sparshvohra99444 жыл бұрын
simple and clear!!!
@kavindra38234 жыл бұрын
Very easy explained. My doubts are cleared. Thank u sir
@avantikaviraltrack6853 жыл бұрын
Very good
@srijat2802 жыл бұрын
Spr sir ❤️ explanation is really awesome 😍
@statusshortz22692 жыл бұрын
Thankyou very much sirrr..🙏
@subhranil_mukherjee5 жыл бұрын
this format is quite good sir. keep it up
@Codeshub20244 жыл бұрын
Sir plz do the coding for all topics in data structures
@anindyasundarhazra25234 жыл бұрын
Very nice Sir
@ArifulIslam-im7wr3 жыл бұрын
Outstanding explanation ❤❤❤
@NOPerative5 жыл бұрын
Excellent video.
@veasnahuy84513 жыл бұрын
Love your videos. Can you create a video on Hash table and hash code?
@taneeshasrivastava74314 жыл бұрын
best for linked list !
@nickdouroudakis43934 жыл бұрын
hi! if i want to add defence programming (a>0 && a
@sukanyabasu70903 жыл бұрын
Thank You
@sunilsaini-yb7lb5 жыл бұрын
U r always awesome ,plz keep uploading sir
@ivanlovich58853 жыл бұрын
Excellent video! Just one question, I don't fully understand why p = head after for loop. Anybody can help?
@Aakash-qr6ky3 жыл бұрын
Becoz we have to print values of data from starting , but before declarating p=head , p was pointing the null of q so that's why..
@srijanapangeni58385 жыл бұрын
Write a c program to construct a linear link list in c to store student records .The record contains roll no and total Mark's. The program stops when a negative roll no is entered . How to do this pls hlp.
@holyshit9225 жыл бұрын
I think i finished your algorithm for merge sort linked list but i am not sure is it correct , it seems to be correct but i didnt test it correctly (You have find middle function - second head , and merge sorted linked list to form new sorted linked list I wrote splitBefore function because you had found second head In merge functon i set prev pointers and pointer tail node and i wrote recursive sorting function) I have also partition sort linked list but I think that code can be simplified I have tree sort linked list , worst case can be eliminated using red black tree or AVL tree Our linked list will be general if we use void* as data type, use variable number of function arguments, and pass function as parameter to other function fe for comparison
@holyshit9225 жыл бұрын
ideone.com/srAlNc Linked List by Robert Lafore Merge Sort I (have) finished algorithm that Vivekanand Khyade described Partition Sort I decomposed it into parts and wrote each part Goodrich & Tamassia slides was helpful for partition step BST Sort I have found necessary functions on the internet Exercises for you Try to implement non recursive merge sort - natural merge sort is an option This Partition sort uses Lomuto partition which is applicable to both singly linked list and doubly linked list Try to write Partition sort with Hoare partition Time complexity for worst case of this BST sort is O(n^2) Try to improve worst case by using self-balancing BST
@gauravshukla93395 жыл бұрын
yar what is this ..size of link list is fixed in your video....is it the link list???
@Devil_queen_5.06 ай бұрын
Thank you so much Sir
@abhishiekmahajan91035 жыл бұрын
❤️
@SarangaE-gv5hf3 жыл бұрын
bloody damn explanation
@rahulsinghai30335 жыл бұрын
Hello sir please explain flattening of linked list question if you find time
@ramyagangolu84495 жыл бұрын
Sir,plzz upload graph coloring using backtracking
@nadiahossain73275 жыл бұрын
Hello Sir, can you please do hasse diagram.
@siddhantshelake29284 жыл бұрын
After for loop completes, why we have to write p=head in the code
@Misia4852 жыл бұрын
The p=head is used so that p point at the start of the list since we need to print list from start. Before that the p was not in the start. Hope that helps.
@godofwar44883 жыл бұрын
please tell what is the name of the compiler
@thomaspgeorge43393 жыл бұрын
Dev c++
@pawanpal1849 Жыл бұрын
❌ sizeof() is an operator not a function
@nihadabbikar57883 жыл бұрын
Sir, can you write the same linked list program to get the output as Banana->orange->pineapple->mango->apple, as the output...when I try to do the same with the above strings I am getting segmentation error...please sir upload such program...it will be a great help
@iulia-andreeagrigore41103 жыл бұрын
I got Segmentation 11 when I run the program.
@sgsworld49297 ай бұрын
Sir code gulo aktu vs code e run koriye dekiye din
@rohitsingla44203 жыл бұрын
These teachers are in university,not those rude teachers
@ghaxianaeem78484 жыл бұрын
Kindly find and back opertion implement if any one ve then share link plzz
@sravankumar47505 жыл бұрын
hi sir.
@varshaa66755 жыл бұрын
#include #include struct node{ int data; struct node *next; }; int main(void) { struct node *p,*temp,*head; int n; scanf("%d",&n); int element,i; scanf("%d",&element); temp=(struct node *)malloc(sizeof(struct node)); temp->data=element; temp->next=NULL; head=temp; p=head; for(i=1;idata=element; temp->next=NULL; p->next=temp; p=p->next; } p=head; while(p!=NULL) printf("%d",p->data); return 0; } the same code u taught but i am getting infinite values i give could u help me to debug it
@sahanasshenoy88785 жыл бұрын
Hey you have missed to create a node in forloop before allocating the element to the temp; Temp already pointing to first node and same node is altered. and at the end, you haven't iterated the link of your node in while() its stucked at first node only.
@sahanasshenoy88785 жыл бұрын
#include #include struct node{ int data; struct node *next; }; int main(void) { struct node *p,*temp,*head; int n; scanf("%d",&n); int element,i; scanf("%d",&element); temp=(struct node *)malloc(sizeof(struct node)); temp->data=element; temp->next=NULL; head=temp; p=head; for(i=1;idata=element; temp->next=NULL; p->next=temp; p=p->next; } p=head; while(p!=NULL){ printf("%d\t",p->data); p = p->next; } return 0; } Compare this with your program if you got confused
@sahanasshenoy88785 жыл бұрын
Dry run your program on paper step by step first. you will get to know. if not refer below.TRY FIRST IN ORDER TO UNDERSTAND WHAT YOU ARE DOING.
@samiulislamdurjoy4 жыл бұрын
G 33
@vinaymishra95235 жыл бұрын
hindi me kyu nhi explaination karta koi?
@franciscrypto91432 жыл бұрын
mura kag amaw buanga ka
@twinklegarg14134 жыл бұрын
Sir -> ka meaning kya hota hai??
@yhz2K4 жыл бұрын
its directive operator -> ka matlab aap Pointers use kar rahe aur kisi cheez ki taraf Point kar rahe hein , Pointer use karte waqt is tarah access kiya jata he