Single Linked List (Inserting a Node at the End)

preview_player
Показать описание
Data Structures: Inserting a Node at the End of a Singly Linked List
Topics discussed:
1) C program for inserting a node at the end of a singly linked list.

Music:
Axol x Alex Skrindo - You [NCS Release]

#DataStructuresByNeso #DataStructures #LinkedList #SingleLinkedList #InsertingANode
Рекомендации по теме
Комментарии
Автор

Your way of teaching and presenting makes the subject easy to grasp ✊ and the best 🌟 thing is that you do all this under 6-8 minutes(speaking generally).

vijaysinghchauhan
Автор

I've tried to figure this out all day. This video is straight to the point and goes thru line by line

-saltless
Автор

for those who are confused about the part " while (ptr->link != NULL) " and (ptr!=NULL):
it would't be (ptr!=NULL) cause during node 3(3000), it satisfies the condition (ptr!=NULL ), so ptr becomes ptr->link =NULL .
So in next part to assign temp in ptr->link first we need ptr .but as it has become NULL (mentioned earlier) simply ptr->link doen't exist anymore.
It was my understanding . pardon my english.

isteak.
Автор

Kitna aasani se samjha diya sab kuch NESO ACADEMY ke aage koi nahi hai .

aspiredifferent
Автор

Sir you explain each and everything in such a manner we go to automatically deep of the subject
Amazing

ajmalkhaniit
Автор

An in-depth explanation of the linked list concept. Great Work!! I hope you are going to make videos on other data structures too.

abdulbaseermahmood
Автор

Great Explanation. The function add_at_end can also be created without creating pointer ptr. We can just use head variable in the loop. Some might say that it's not possible because this will change the value in the head variable; however, this won't happen because address in head variable can only be changed inside main function where it was created. Only the copy of the value stored in head (in add_at_end function) is enough to traverse the list. This can be used to reduce the space complexity.

AishLovesSpaghetti
Автор

Sir plzz upload stack queue and other parts of ds videos....ur way of explianing and visualization is speechless

SatyaPrakash-olgv
Автор

Hey neso academy! Are you guys fine? You haven't uploaded videos. Hope u guys are doing well!

dudefx
Автор

Amazing lectures! Thanks a lot Neso Academy and the instructors for making such good content and that too for free! :)

sallavatsal
Автор

this is the best channel on youtube, please keep uploading the other data structures after linked list also

eceagauravgogoi
Автор

Jindagi me pahli bar esa teacher dekha Jo enta difficult chapter ko easy bana Diya thank you so much sir ❤❤❤❤

ahmadaklakh
Автор

You make difficult concepts sound so easy.

DatasafeWorld
Автор

great explaination since morning 8 am im not understanding this inserting and linked list now its 10 pm finally all doubts are clear and now im doing on my vs code

dhananjay
Автор

First of all,
Thanks for such an easy explanation. Can you please upload video lectures on Microprocessors(8085, 8086, 8251, 8259, etc) since we are facing problem in that subject too.

harroopsinghgala
Автор

Im d frst student for the lecture.!! Yayyy way to go neso... very well done

iqbalahmed
Автор

So great explanaition that raisded a question for me: shouldn't we use a double pointer in "add_at_end" function?
The head seems to be lockal in the function.

mamo
Автор

finally someone who explains algorithm

Lordash
Автор

Thank you soooo much for sharing this, making learning programming in C much easier(also teaches me to understand indean accent lol

yuechenxiao
Автор

You guys are giving way too good content.thank you so much these lectures are helping me a lot.🙇‍♀🙇‍♀

selfyqueen