Insertion of a Node in a Linked List Data Structure

preview_player
Показать описание
Singly linked list insertion: In this video we will see how to insert a node in a singly linked list!

Best Hindi Videos For Learning Programming:

►C Language Complete Course In Hindi -

►JavaScript Complete Course In Hindi -

►Django Complete Course In Hindi -

Follow Me On Social Media
Рекомендации по теме
Комментарии
Автор

Hope you understood. I have asked few questions on linked list in the video, answer zroor karna!
Also if you share this playlist, that would be an immense help
Instagram- instagram.com/codewithharry

CodeWithHarry
Автор

15:55 O(1), because the pointer to the node after which another node has to be added, is given. So irrespective of the total no. of nodes in the linked list, it will run for a constant time. Hence O(1) time complexity.

rickk
Автор

Best teaching methodology i had ever seen On DSA!!

pushkalshukla
Автор

15:53
Time Complexity for Inserting after a node = O(1)
Because the pointer to that node is already given, so in every case, we are inserting the node at a constant time.

chessnerd
Автор

Remember- Head of the list is not a node but a reference to the first node in the list.

vihansamvedi
Автор

Harry bhaiya you r truly legend for engineering student 🙏🙏
I think u r better better better than my DS teacher 👍

shivamjha
Автор

Kon kon chahata hai ki harry bhai java ka full tutorial banae
Like kro
👇👇👇

jashanpreet
Автор

16.02
Time complexity for adding after a node is O(1)

harshitachaurasia
Автор

Harry bhai apka ehsaan zindagi bhar nhi bhoolunga
Meri dil se dua hai apki har khwahish puri ho ❤️😘

bossgaming
Автор

You are explaining in the best possible manner . Thank you bhaiya!😇
You made it INTERESTING 😃

shivamshresth
Автор

Sir apke video upload hote se hi main download kr leta tha toh uspr comment nhi kr paata tha so i waited for this video so that I could comment... Sir aapne pucha tha k apke examples topic smjhne m help krte h ya nhi toh sir I just want to say... I started learning dsa from so called famous youtube channels but the conclusion was I was about to leave coding but I always enjoyed watching your videos so I saw your course - sir your teaching skills, your body language, your accent, your notes, your examples are insane and learning from you is the best thing ever happened with me.. Thanks a lot sir for your notes, tutorials, hardwork and for everything ❤

nikhilsinghparmar
Автор

Sir this DS series is best
(Sabhi tutorial series se
And your notes are awesome....
Very thankful sir

AdarshSingh-cbyf
Автор

16:01 O(1) is the time complexity for Case 4: Insert after a Node.

ayanavadas
Автор

The most hard working youtuber i have ever seen.The most hard working youtuber i have ever seen.The most hard working youtuber i have ever seen.The most hard working youtuber i have ever seen.

sarthakmoriya
Автор

15:56 time complexity is O(1) thanks harry bhai for these great videos♥️♥️

swapnilbhojwani
Автор

Case 4 will be O(1) as traversal is not required. We already know the node after which we have to insert the new node. So we can perform the operation in constant time by altering the linkage.

kajalpal
Автор

15:53 time complexity is O(1) . It will take constant time.
Edit : Harry Sir Heart to banta h😁

surajbugade
Автор

15:57 the time complexity will be o(1)

webcreationstudio
Автор

Sir u r nind blowing teacher big fan of u sir kya teaching style hai sb crystal clear ho gya a big salute sir

ranajyoti
Автор

Sir, humne bahut sare videos dekhe Hain other channel ke, apna collage, collage wallah sabhi ke per samajh nahi aaya per aapka sir ek baar mein hi samajh aa gay . amazing sir
Thankyou so

Rani-gvpn