Inserting the Data at the Beginning of Single Linked List (2nd Method)

preview_player
Показать описание
Data Structures: Inserting the Data at the Beginning of Single Linked List (2nd Method)
Topics discussed:
1) C Program for inserting the data at the beginning of a single linked list.

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

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

Just great!! The visualization of the pointers and lists is so good! this is the way to teach these things otherwise it just confusing. I think every student should view your lectures even though they familiar with the subject. Thanks again :)

AlmogYosef
Автор

Just wanna say thank you Neso Academy.
I followed your videos throughout the last four years of my engineering. You made my life easy.

devashish_manna
Автор

I was stuck with this doubt thanks for clearing it out, great help.

NiranjanKJ-wn
Автор

Every video of Neso Academy leaves me with a single doubt that

HOW CAN IT BE SO UNDERRATED?

uniqueelsa
Автор

Just another great tutorial. But please sir at least one video everyday. Please sir please.

kajalmondal
Автор

Dear sir please complete this series as soon as possible.❤

sajadulislamdipu
Автор

very helpful, thank you for your honorable work.

buntagkendrick
Автор

BEST CHANNEL ON ALL YOUTUBE! THANK YOU SO MUCH!

PlrYdei
Автор

I learnt the basics of C language from somewhere else, but @NesoAcademy has made my concepts and understanding even more stronger. Thank you very much. 🙏🏼🙏🏼

kunalkhallar
Автор

I know you guys are working too hard to provide free quality education but my request to you guys is to upload at least 1video per day on data structures, please its my request
And video was great as usual
thank you🙏

maca
Автор

dear sir,
now i can make program even before watching video .
mistake encountered in previous lecture, I also had culprit of that and resolved on my own

hritikrastogi
Автор

Giving slightly different names to the actual and the formal parameter reduces the chances of errors.

jaydomadia
Автор

The easiest way is to declare the head pointer globally, then we won't have to pass the pointer or address. Passing just the value to be inserted in the linked list would be enough.

sunnydeol
Автор

void add_at_beg(struct node **head, int data) {
node* beg = new node;
beg -> data = data;
beg -> next = *head ;
*head = beg;
}

you can try this too.

herohera
Автор

@Neso Academy team, are you going to teach doubly, circular linked list, tree in upcoming videos under data structure section.

vishwaskumar
Автор

I've been using global structs to overcome this problem. Is my method good or should I use the method in the video instead?

riviayanuar
Автор

Who else feels gifted to be studying computer science at a time when neso academy has already completed thier playlist😍😍

lexingtonjackson
Автор

then why in case of adding node in the end, when we use void, it permanently changes the main function of head

MarufHasnat-dw
Автор

It's something like:- "Making one mistake to cover up another mistake!" 😅😂

AstitvGupta
Автор

Sir sir please upload c++ tutiorals sir please it's my humble request🙏🙏😭

kusumaseera