Linked List - Insert Node at beginning or end using C++

preview_player
Показать описание
In this tutorial, we have covered inserting a node at the start/beginning of a linked list and inserting a node at the end of a linked list. We will also write a program in C++ to implement insertion at the starting and end of the linked list.

0:00 Ways to Insert Node In Linked List
0:18 Insert at the Start of Linked List
2:00 C++ Code to Insert at the Start
2:50 Insert at the End of Linked List
4:38 C++ Code to Insert at the End

-------------------------------Source Code ----------------------------------

-------------------------------Android App ----------------------------------

-------------------------------Support Us ------------------------------------

-------------------------------Like on Facebook ------------------------------

-------------------------------Follow on twitter --------------------------------

#linkedlist #insertnode #startandend #cplusplus #tutorial #datastructure #algorithm #codewhoop
Рекомендации по теме
Комментарии
Автор

how useful the whole playlist has been. Watched videos of length <1hr on Linked list. But still this playlist saved me one night before my exam. You literally explained every single line of code. Thanks!!!

rajarshichaudhuri
Автор

Simple, clear and awesome explanation....You saved the day, thank you so much

_debrudrabhadra
Автор

Well done, you explained better than what my prof did in the past 2 hours.

stinyg
Автор

THANK YOU!!! Ive been stuck on my problem set for like 2 hours. This video made it easier to understand and I was able to complete the assignment.

MiguelLopez-phqb
Автор

Dude, thank you so much for making these!! I cannot stress how helpful they've been!

alfredpeter
Автор

Simply just awesome! One thing I could mention is in the source code you could pass the pointer of the pointer of the Node so that you could track in the main and no need to put "Node *head=NULL;" in the middle of the functions. As a demo it is fine.

The passing argument for the function could be "void insertEnd(Node** head, int d)"

This is my main looks like:

int main()
{
struct Node* head = NULL;
insertEnd(&head, 4);
insertBeg(&head, 3);
insertEnd(&head, 2);
insertEnd(&head, 1);
insertBeg(&head, 5);
printList(head);
}

jackthehammer
Автор

I was trying to understand this for while and now i am surprised how someone can make some topic so easy... thank you.

sidhantranjan
Автор

I have my Cs exam tommorow and I didn't know any thing about linked list but after watching your video I feel confident. Thanks a lot.

valerian
Автор

Wasted so many hours looking at other videos.. But finally stopped here.. perfect and easy explanation

engulfing_marubozu
Автор

Watched many other related videos but this was the most simple and easy to understand

usamabg
Автор

Best Series of Videos on YouTube for Data Structures. Can see your hard work, thanks a lot. I got all my doubts cleared.

pratikjain
Автор

It was too helpful i search many videos videos but i didn't understand linked list. but your explanation makes me to understand it . thankyou!

areebakhan
Автор

Dude this was helpful I had been trying to understand this concept from past week but after seeing your video it is crystal clear to me thank you so much!!

CS-IT
Автор

Seriously this was what I needed. Thank you so much for uploading it.

utkarsha
Автор

Easiest and best approach, thanks brother.

asheeshsingh
Автор

I'm from VietNam and i love this video. It's so easy to understand ♥

minhhnh_in_jp
Автор

Great work in other videos available on youtube I was able to understand the concepts of the linked lists but the implementation part I was unable but your lecture works great for me. KEEP IT UP!🙌🙌

avinashchaurasiya
Автор

You explained it in such an easier way. Thank you so much sir!!🙂

_jaishreerana
Автор

Perfect!!!! Perfect!!! this is what i wanted...thank you soooo sooo much to whoever taught dis!! you are a life saver...

chaithravasista
Автор

Straight to the point, thanks alot man

TheWildGamerIsHere