Insert a node in Singly Linked List( at the start , middle or end)

[@shabbinhossain8127]

Finally someone explained me what is a linked list and how to use them! Thank you sir!

[@yourtube3214]

Yes this is called satisfaction 😀

[@db917]

i have been struglling with linked list for almost 3 or more weeks now,im left behind since the lecturer done it in class i couldnt really move on coz i was stuck, the only reason i didnt come on this channel before is its teaching on the board and i only checked videos that explain with writting running program directly on ide. and just randomnly today i dicided to check more videos even the ones that are just explained on the board andhere i am,only one video made me understand what i have been struggling with for so long,Im really grateful, thank you.

[@gauravbharti5390]

got better explaination than my code school ..keep it up bro

[@andythomson2227]

💓Finally got it sir after surfing for 1 hour on KZbin for finding this concept.

[@RohanGSadnani]

Sir, aaapko hats off, Your Explanation is the best, because even our NMIMS university teachers can't explain it in an easy way they make it more complex, and during practicals, they tell us to find the solution on our own, iska matlab explanation bhi barabar nahi aur upar sae practicals bhi kudh karo....

[@gamerz8220]

yes you have really cleared some of my confusions i was really stressed and could not able to understand linked list at all thank you

[@subramanianchenniappan4059]

I am an experienced java developer. able to understand your explanation. good

[@zoyajaved4181]

Plzz make a good video of this thing

[@poojayu9100]

I am your fan.....your teaching is excellent.....

[@soubhagyasamal4049]

your teaching process is fantastic... easily can understand...

[@vircycure]

Very nice explanation. There is no doubt after your teach because of your explanation. Thank you sir

[@lordsaint4956]

Sir you're great! JUST WOW. How can this be so easy i asked myself literally, because in college lecutres i found it so tough. OmG. Sir you're great! Thank you sir. ❤️

[@vipingautam9852]

Thanks Vivek you've explained everything thoroughly!

[@raprathiksha2906]

sir,excellent explanation... Made linked list simple

[@kolanaresh7077]

bro your teaching is excellent and voice also excellent

[@aadeshgaikwad3018]

Best explanation, you have cleared my all concepts 💯

[@tanishsharma9127]

Very impressive video. Explaination is amazing.🔶

[@rohandubey8163]

Sir you are brilliant means many college teachers has failed in front of your teaching way criteria , bhut bhut bhut badhiya explaination thank you thanks a lot sir .i always fear about linked list & its code but your this video ,make my confidance strong that #I #CAN

[@vivekvish2955]

Short n best...... thankyou sir

[@vikrantsanke3554]

Hello, You did not include your video - Introduction to Linked List ( very easy) in this playlist. That video is really useful for basics

[@diedie111590]

Thank you I really appreciate your help. Linked list was always difficult for me.

[@guilfuchi23]

Really help me to understand completly, thanks, you earn a new subscriber

[@somputhea6709]

Thank you so much sir. I learned a lot from you.

[@leozhong9270]

thank you sir, even though this video is from 6 years ago. Really good explaination!

[@sadanimalsha1482]

Well explanation. Keep it up Sir!!!

[@nikolaiunger6932]

thank you very much. It helped me to understand linked lists

[@EntLaut]

You explained everything except the most important thing,how to find insert position.

[@bprincepandey]

insert position is given in the question

[@DevOpsGuy0]

You have to give the insert position by yourself

[@davidbarnwellutech4663]

You can search for the insert position create to new nodes.. currentNode = headNode and previousNode which points to 0 (previous->next=0). Then, in the case of a sorted list ..traverse the list..searching for the insertion point. Something like while(CurrentNode->dataElement dataElement) {previousNode=currentNode; currentNode=currentNode->next; //THEN... // you put the new node BETWEEN currentNode and previousNode } or in the case of an UNSORTED list something like while( current->dataElement != insertionPoint->dataElement) like Mr Khyade was saying

[@andythomson2227]

insert we have to choose that

[@videomoment3409]

By count++ till Null

[@afjalsharifopu5058]

Best, Best and Best Explanation ....

[@rohanyadav764]

kamal ho sir aap ....

[@vincenr8822]

These videos are way too good.

[@vivekanandkhyade]

Thanks Vinster...!

[@mansisakariya2193]

very nice explanation sir...thank you so much sir

[@anuragchatterjee241]

Sir ! Ur way of teaching is just commendable. Could you please explain me the topics of hashing ?

[@pradeepmishra4021]

You are awasome man.

[@nandhinimurugesan7605]

My sincere thanks to you sir.....

[@amiratnapuri7678]

thank you so much, good video bro!!

[@vivekanandkhyade]

Thanks sister..👍👍

[@Veenathementor]

You are such a great teacher sir u really solve my all problems thanks I really subscribe you thanku

[@THEmrkrebz]

Another great video thanks!

[@THEmrkrebz]

I agree!

[@ganeshchakka7971]

nice explanation sir

[@biplabsarkar5485]

Excellent explanation sir.

[@ajitsahu8319]

Awesome sir great videos

[@mehwishvirk5670]

U r good teacher ..... ALLAH bless you always....

[@monicaagarwal8517]

Great explaination..👍

[@sumukhagc5528]

plz sir make videos of data structures in java also Ur explanation is very good

[@teshaleseifu7074]

Wonderful teaching way

[@chandrasekharanumula4137]

Very good explanation

[@shaikias098]

U will expalin perfectly but on board u will explain we will understand by it but doing in computer that so that we can see execution is also important sir .please do that for whatever code u tell.Its my humble request sir.please sir

[@sridipdas1786]

Explanation is Awesome.

[@gaoqiangzhou9960]

thank you, clear and helpful

[@xul5839]

You save my exam

[@vivekanandkhyade]

Thanks

[@MrMarkgyuro]

that was cool. subscribed!!

[@angelahendy4571]

thank you very easy to understand

[@roligautam3857]

Thanks for such a great Help 😊😊

[@Shraddhas__Cookhouse]

Thnx sir..... It's really understandable

[@anshumanmishra2555]

Here is the full executable program #include #include struct node { //Structure named node to store integer in variable data and a pointer variable which can store address location of next node int data; struct node *next; }*head; void insert(int data) { //This function will insert a new node to the start of the linked list struct node *temp = (struct node*)malloc(sizeof(struct node)); temp->data=data; temp->next=head; head=temp; } void add(int data) { struct node *temp,*p; int loc,len,i=1; printf("Enter the location"); scanf("%d",&loc); len=4; if(loc>len) { printf("Invalid location"); } else { p=head; while(inext; i++; } temp = (struct node*)malloc(sizeof(struct node)); temp->data=data; temp->next=p->next; p->next=temp; } } void display() { struct node *temp; temp=head; if(temp==NULL) { printf("The list is empty"); } else { while(temp!=NULL) { printf("%d->",temp->data); temp=temp->next; } } } int main() { insert(1); display(); insert(2); display(); insert(3); display(); add(6); display(); return 0; }

[@shubhrajitparida6399]

Best explanation

[@chandusatish9697]

Nice explanation thank you...Bro

[@travelnlearn]

very nicely explained

[@mohammedkapasi769]

very good explanation.

[@jeya7125]

Thanks for the tutorial.Very good.Can you please share for Circularly Linked List ?

[@dainaetishaa5006]

Best.. explanation..ty sr

[@yuqian822]

Thank you!

[@TheStifler46]

Excellent, I have become a fan of you. Also can you make videos on string algorithms

[@tharunyajayaseelan9674]

I understand your explanation. thank you

[@koreandramamix866]

Explanation is really good but you speak very slowly

[@mahamamir9176]

Watch at x1.25

[@AdeshPaul]

Thanks for teaching.

[@AbdulWahab-ri7cd]

Thank you so much sir ❤️

[@poojachitalkar9245]

thank u so much sir 😘😘😘

[@raveendrakumar7452]

nice sir ji

[@ishup7696]

very helpful thank you sir

[@thashmithamandrira9829]

V good explanation 👍

[@kunalpatil6961]

perfect bhau...

[@Handling6265]

Thankyou very much sir 😊😊

[@philimonphiri2817]

thanks its easy here to understand

[@lilug2744]

Sir Maza agiya bohat dhoonda per ap say Maza agiya sir please implement in java compiler how classes made please explain

[@kelvinkipchumbakoech9758]

Very nice, Bravo!

[@ahmedmohammedyahia7666]

Thanks for you ❤❤

[@hariharanm2906]

Really, a fantastic video on youtube.

[@9893011111]

Case 2nd, how can be a pointer P can be checked with position ??

[@kattapriyanka8457]

very good explanation

[@playerpl2772]

I have a question. When inserting a node at the end, i use the code below and it didnt work. I dont know why while (p != NULL) { p = p->next; } p = new_node;

[@andycommp5234]

try using this while(p->next != NULL){ p = p->next; } p->next=new_node;

[@lironstern1979]

@@andycommp5234 what is p though?

[@UsmanAli-cl5xg]

👍👍👌👌

[@sagarjadhav3564]

Hello sir, I want to create a linked list only & display that linked list.....(how many nodes this input it given by user) what can i do sir?

[@prachibarathe6490]

It's really helpful

[@GlobalHuntersTech]

thnk yu sir ....

[@veeshankiagarwal1277]

can u please explain Algorithm for Circular Linked list.Your Videos are good.

[@winnieveronica1139]

Finally understand haha. Thank youu very much

[@rahulkhartude4918]

Thank you sir❤️

[@jennychinyama8665]

jenny chinyama I have enjoyed the lesson on linked list

[@gauravbharti5390]

good video for beginners ..

[@chandanchakraborty6787]

please make an of circular linkedlist...it's very important . thank you

[@Maa_Inti_Vanta]

Sir... In insert node in the middle algorithm, can we write like newnode=p->next p->next=newnode

[@shubhampatel7870]

we won't need an additional pointer then... it is supposed to be done that way actually

[@Maa_Inti_Vanta]

@@shubhampatel7870 ohh tq sir

[@Saumya9258]

sir , ur lec videos are really very helpful.can u plz post a lecture on ' addition of two numbers represented by linked list' .

[@vivekanandkhyade]

Yes sure very sooon

[@kalaiselvan7840]

Just loop throughout the end and within the loop add node->data.

[@bradwang3648]

very helpful.. thanks!!

[@mikhailpalagashvili169]

Why can't we just keep a tail reference and make the add at the end o(1) instead of o(n)

[@bonchodikov6248]

Well done sir ! 10x :)

[@naolworku1823]

wowuu nice vedio

[@hameedmulani21]

Very good video 😇

[@raghavmalhotra710]

To the point and great!!

[@bhavyasachula7006]

thank you .

[@robinahmed3310]

Very Well Done .

[@rebeccalrebeccal8614]

I need full description of list and tuples