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 Playlist: ruclips.net/p/PLu0W_9lII9ahIappRPN0MCAgtOu3lQjQi Instagram- instagram.com/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.
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.
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 much.........😊
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 ❤
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.
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.
Sir, Please make playlist on NodeJs, NodeJs tutorials in web development playlist are not enough to understand it completely🙏🙏, mene web development (front-end) aapse hi seekha, and backend(NodeJs) bhi aapse hi seekhna chahta hu but web dev ki series mei node js theik se samajh nhi aaya, jis tarah javascript ki separate playlist aapne banai hui hai usi tarah NodeJs ki banadoge toh maza aa jaega.
15:57 - Time complexity for Insertion after a node is O(1). since we don't have to traverse each and every element of the linked list because the node is already given
16:04 Time Complexity of Insertion after a node is O(1) , as the node after which the element is to be added is given ,so it will take the same time irrespective of any given value
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
Playlist: ruclips.net/p/PLu0W_9lII9ahIappRPN0MCAgtOu3lQjQi
Instagram- instagram.com/codewithharry
bhaiya video mein to first nahi hun lekin aapka comment like karne me first
Bhai... Exercises bhi laaya karo na pahile jaise ... @CodeWithHarry
Bro please make videos on Trees and graphs in Datastructure.
Bro this series in python also🙏🏻🙏🏻🙏🏻
Sir please make vidio for java😇
Best teaching methodology i had ever seen On DSA!!
Houda houdaa
Toh apni gnd mrwale iss se
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.
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.
Harry bhai apka ehsaan zindagi bhar nhi bhoolunga
Meri dil se dua hai apki har khwahish puri ho ❤️😘
Harry bhaiya you r truly legend for engineering student 🙏🙏
I think u r better better better than my DS teacher 👍
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 much.........😊
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 ❤
O(1) [15:59]
Remember- Head of the list is not a node but a reference to the first node in the list.
Head is pointer type of node and also it is refrance to first node
In this lecture head is also node in which store data and link to other node
First node in the linked list is regarded as head node and its address is used in head pointer
Muchh needed👍🏽
@@kishankhanna10 ❤️
sir is genius...........bina interaction ke bhi bhi sir ko pta chal gya ki bacho ne O(n) kha hoga..........maine bhi yhi kha tha.......
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.
bro for inserting of node in the end time complexicity should 0(1) because it is end nnn
@@motivationalkk6074 no nut November?
Kon kon chahata hai ki harry bhai java ka full tutorial banae
Like kro
👇👇👇
Ha harry bhai please banao
Please banao mujhe app developer ban na hai
@@jashanpreet5668 bhai flutter and dart padho
Me too...harry sir please vidio for java.. As u made c in 15 hr like that please please please please
Please harry sir java pe vidio banado 😇and thanks for the content u r providing us for free❤️
You are explaining in the best possible manner . Thank you bhaiya!😇
You made it INTERESTING 😃
Sir this DS series is best ........
(Sabhi tutorial series se )......
And your notes are awesome....
Very thankful sir
Where is notes?
15:53 time complexity is O(1) . It will take constant time.
Edit : Harry Sir Heart to banta h😁
Vai, apka samjhane ka tarika bohot acha hai.... finally it fits into my mind forever.... Thanks vai ....
Bhai ..har jagah samjhne ki koshish kari..par yahan par ek tarfa tareeke se sabh clear hogaya.
Loveyabro💖
Sir u r nind blowing teacher big fan of u sir kya teaching style hai sb crystal clear ho gya a big salute sir
16.02
Time complexity for adding after a node is O(1)
lagta h improvement ho rhi :P
@@amanraj8293 yup
15:56 time complexity is O(1) thanks harry bhai for these great videos♥️♥️
Best video on Linked List.
I never found such an easy explanation before.
wish I watched this before my exams
Best teacher for coding thanks sir
Just completed this lecture of yours Harry Bhai and it was wonderful as usual. Thanks a lot for the session!
I have practical day after tomorrow!! Really thankful to you for such a great teaching🥺🙌
15:56 Time complexity of inserting a node after O(1)
16:01 O(1) is the time complexity for Case 4: Insert after a Node.
Following Ur complete DSA course since long....
You are best programmer in you tube.
You are the best teacher ever i seen
15:57 the time complexity will be o(1)
15:55 O(1) is the time complexity because we have to insert a node after a given node ; we don't have to traverse the entire linked list
best explanation ever....Great teaching
Thanks bro with your hardwork i can learnn programming very well🙏
harry proves the quote a king does shout all day he is the king.
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.
15:56
Insert after a node -> O(1)
Excited for next video!
O(1) is time complexity for case 4
time complexity will be O(1) for inserting a node after a node
harry bhai dil jit lia h aap ne bhai yr
Still Worthy. More love and Respect to you Sir.
Sir ji salute hai aapko .❤️ Very hard working 😘
Sir, Please make playlist on NodeJs, NodeJs tutorials in web development playlist are not enough to understand it completely🙏🙏, mene web development (front-end) aapse hi seekha, and backend(NodeJs) bhi aapse hi seekhna chahta hu but web dev ki series mei node js theik se samajh nhi aaya, jis tarah javascript ki separate playlist aapne banai hui hai usi tarah NodeJs ki banadoge toh maza aa jaega.
Please continue the c++ course, I am eagerly awaiting Harry bhaii. It's been very long you have not added any video... Please add 🙂🙂🙂
simple and easy explanation!
For case 3 Insert at end - we can make time complexity O(1) maintaining one last pointer similar to head.
Last ptr will point to last node of list.
You are a king sir.
you are like an lifeline for coder
I am new here
can you pls tell me about the language (like c, c++,java etc.) in which this playlist is going on⁉️⁉️
hats off the way you teaching.... great harry bhai.
bht badiya ache se smj aaya great
Bhai you are the best. I love your teaching style..
Case 4:O(1) because the pointer is already given and it's obvious that we have to add nodes after another nodes each for a constant time.
U r world best teacher
15:55 time complexity for insert after node is 0(1)
At 16:01 the time complexity will be bigOh O(1) as the q is constant and the value of q has been assigned already. So yes, it will be O(1)
nice video sir ji💌💌💌💌💌
The way you explain just woo...w,,,n just waiting for watch 1M+ subscribers of CodeWithHarry
sir understood!! Time complexity me issue but abhi samjha
Harry bhaiya you are the best ❤️
Unlike the rest ❤️
Thanks for building our future ❤️
You are like a guardian angel to us ❤️
15:59 Time Complexity will be O(1)
as it runs in constant time.
congratulation sir for 5 million subscribers
Best teacher ❤️
Very nice, interesting Harry bhai
15:58 time complexity is O(1)
sorry harry bhai video thodi der se dekhi
best video
bhai u are a saviour !!! thank you
Love you sir from West Bengal..❤️
thank you harry bhai!!!!!!!!!!!!
16:00 - O(1) Bcz pointer after which the node is to be inserted is given ,so o(1)
Harry bhai is the King Kong of coding 🤗
you are such a gem🤠
We love you Harry sir!! The best of alllll!!!
15:57 - Time complexity for Insertion after a node is O(1).
since we don't have to traverse each and every element of the linked list because the node is already given
16:04 Time Complexity of Insertion after a node is O(1) , as the node after which the element is to be added is given ,so it will take the same time irrespective of any given value
Bro make this series in Python too please🙏🙏🙏🙏🙏🙏
best guy harry bhai
16:00 time complexity for case 4 is O(1)
wah wah 😍 cha gye bhai lage raho Harry bhai
u r amazing ,hats off 2 u❤❤
16:03 insert after a node, O(1) ❤️
Oh god i love this man..you are genius.❤
Harry bhaiya done with this thank you
Data structure ke liye 1-2 books sabse acchi batado harry bhai. Study acchi hogi
Awesome video
Thanks for teaching us 💟
16:05 O(1) ❤
Bhai case 4 me maza aa gya👍
16:09 - Time complexity is O(1).
but its okkk ap bht ache s smjhate ho really thanks for it
The time complexity of insertion after a given node is O(1)
Thank you sir for this valuable hardwork its still useful for me ... grateful for this ❤️🙇
thx
15:55 Time Complexity is O(1) because the pointet is already given and we don't need tk traverse tha list for this.
Thanks harry for the explainning linlkist
Time complexity is O(1) for insert after a node(4)
harry bhai kas ap hmare college me as a teacher pda dete yar faltu time burbad h college harry is the best👍👍👍👍👍👍👍👍❤❤
5:41 Time Complexity :- O(1)
best teaching sir
16:00 O(1) as q is already given so we don't need to traverse through the list.
Your videos are just awesome