Introduction to Linked List | C++ Placement Course | Lecture 22

[@lifeology9782]

best video ab mujhe clear ho gya ki mujhe coding me nhi jana...🙂

[@muhammadnomanhanif]

hahaha same bro lkn majbori h seekni pary gii

[@Hateem-v7p]

😁😂

[@biswaranjandash888]

Kuchh Samajh Nahi Aaaya...Par Sunke Achha Lagaaaa :)

[@ytnoadds2524]

Didi ka naam kya hai

[@zaeemAtif]

@@hercodes nhi, karega koi join. Ham online free mei hi padenge :|

[@pickachoogaming7976]

Kya samaj nhi aa rha itna pyara to smjhaya hai

[@momozkichutney]

@@ytnoadds2524 11:11

[@tanishasethi7363]

@@momozkichutney nice observation 😂

[@swapnilsrivastava9407]

Jisko pehle se aata hain uske liye to best hain bahut new chj pta chala thankyou didi 😍

[@KrishnaSharma-bv5ys]

Perfect example of everyone with knowledge is not a good teacher....

[@stillaweeb667]

Acha toh padhaya bruh... 3 saal baad got new opinion?

[@shubham.s8934]

Starting be like: Array mein size hota hai, Array accha nahi hai, Array is fixed, Link list has more advantages End: Isse accha toh array hi bana leta....

[@parthkabra8880]

bhai vector hi use karle

[@harshbhansali1327]

@@parthkabra8880 woi to be!

[@sumitsharma6738]

xdddddddddddddd shi batt hai

[@anand.suralkar]

array fragmented memory me ban hi nahi sakta to banaoge kaise bhai

[@abhishekKUMAR-ij7nw]

bhai sabka apna importance hai

[@aryarajput9011]

And that's where difficulty start and competition drops !!

[@cswd428-yaswanth3]

Yup 🔥 of DSA ❤️

[@yupp_harish3936]

yes

[@ashmitsharma9096]

difficulty on linked lists 🤣🤣🤣

[@mohitparker8602]

damn this comment section is clear example that there is no competition in reality

[@siddharthabhunia7897]

Full Code Of This Video #include #include using namespace std; // Create A class node class node{ public: int data; node* next; // Node Class Constructor node(int val){ data=val; next=NULL; } }; // Insert Element At Tail void insertAtTail(node* &head,int val){ node* n=new node(val); if(head==NULL){ head=n; return; } node* temp=head; while(temp->next!=NULL){ temp=temp->next; } temp->next=n; } // Display All Element void display(node* head){ node* temp=head; while(temp!=NULL){ coutNULL 345->12->178->1788->NULL 1

[@humanity7880]

thanks notes wala link open nhi ho rha tha

[@gamingworld3041]

insertAtTail(head,12); insertAtTail(head,178); insertAtTail(head,1788); can you tell me in function call why we are we writing head

[@moonlight-td8ed]

@@gamingworld3041 because you using head function in above void functions which was declared in main function....

[@ankitanand3324]

Thanks

[@starsinger4121]

This code is from apni kaksha

[@rakesh2081]

I think this video is meant for her own revision 😑

[@Rohan-rz2qn]

Actually yes bro I also feel difficult to understand

[@yashagrawal3503]

@@Rohan-rz2qn gfg op

[@21AniketThakre]

These series is for revision purpose . 🥴

[@venkateshsuryawanshi7011]

@@Rohan-rz2qn easy bro if u want to display or search you pass it as simple But if u want to traverse head from one place to another pass by refference

[@YadavDheeraj2000]

😂😂😂😂

[@piyushgupta1381]

Is this introduction for iit bombay STUDENTS..? i think they can't understand this introduction

[@ayushkamboj2812]

From this video difficulty increases and our competition drops🤭

[@ranjanmondal8346]

😂

[@SomilSrivastava2406]

😂😂😂😂

[@SARTHAK_K._PATRO]

Not very good explanation for a beginner... No offence but it could have been better. Thank u for this series

[@prantikofficial]

Exactly

[@madovergaming2002]

Not at all good

[@arijitbhakta9705]

Obviously

[@sansheva7333]

BECAUSE YOU JUMPED STRAIGHT TO THIS VIDEO WITHOUT SEEING THE PREVIOUS VIDEOS.

[@madovergaming2002]

@@sansheva7333 linked list is a separate topic.. And this video is the introduction of Linked list.. So it should have been more comprehensive

[@SJ-qr7qp]

****Creating single Node***** # include using namespace std; class Node { public: int data; Node* next; Node(int data)//creating constructor to fill data in node { this->data = data; this->next = NULL; } }; int main() { Node* node1 = new Node(10);//creating object node1 of node class and allocating dynamic memory to it cout data next = NULL; } }; void insertAtHead(Node* &head, int d)//here done by referance { Node* temp = new Node(d);//creating a pointer temp of Node class and allocating dynamic memory and also creating Node with value d temp->next = head;//assigning temp's next to head of node1 head = temp;//shifting head position from node1 to temp } void print(Node* &head) { Node* sk = head;//here i have passed by referance and i dont want ot change value of head so i created another pointer of name "sk". while (sk != NULL) { cout next = NULL; } }; void insertAtHead(Node* &head, int d)//here done by referance { Node* temp = new Node(d);//creating a pointer temp of Node class and allocating dynamic memory and also creating Node with value d temp->next = head;//assigning temp's next to head of node1 head = temp;//shifting head position from node1 to temp } void print(Node* &head) { Node* sk = head;//here i have passed by referance and i dont want ot change value of head so i created another pointer of name "sk". while (sk != NULL) { cout next;//finding the last position of linked list } tail->next = new Node(d);//adding element to the linked list } int main() { Node* node1 = new Node(10);//creating pointer node1 of Node class and allocating dynamic memory to it and also create node with data 10 Node* head = node1;//creating head pointer and pointing where node1 pointer is pointing insertAtHead(head, 12);// passing data of element which is to be inserted insertattail(head, 4354); insertattail(head, 234); insertattail(head, 21); print(head); return 0; }

[@ShubhamKumar-pv8pj]

Guy's in case you don't understand this topic Keep in mind we are first making a node and then linked them by address of other nodes and initially head is null but in further calls head has address of first node and only temp changes it's address i.e it store address of node from which we link it to other

[@bohotsaaridhop]

node* next ka meaning batana

[@killingjoyandmemeing]

@@bohotsaaridhop node* next current block ke ptr address ko point karega which has the enxt address

[@rocknroll6768]

@@bohotsaaridhop if you are confused plz check codewithharry channel and search for DSA playlist.. no one can explain like him .

[@swapnilkumar4411]

Bhai plzzz tell me why she wrote node* &head bcoz head is a pointer and he will store the address of first node in head.. then what is the meaning of writing &

[@pureJavascript]

@@swapnilkumar4411 & is for changing actual head value wrna copy jaati h function m

[@rahulkumarsingh7615]

I can't understand anything, but i am trying to understand that😂

[@someshsangwan5302]

same here

[@29-rahulsinha91]

Samaj aaya bhai?

[@rahulkumarsingh7615]

@@29-rahulsinha91 yes bro,ab toh placed v ho gya mai😂

[@atomicneutron_]

​@@rahulkumarsingh7615 how? things needed to get good placement?

[@AbhishekKumar-nz9dn]

@@rahulkumarsingh7615 kaha lgi bhai placement ? btw congratulations bro

[@rutvikrana512]

Very good explanation of linked list. 😊 Why to use LL ? When we want to add or remove elements very often and little need to traverse or search elements. Example: stack and queue -> we are using pointer of Node instead of class node. Node * n = new Node(0) -> & before variable on method parameter represent reference by location. If we don’t want to use & then we need to return head node of LL. Node * Insert( Node * head ) { ... } Happy learning 😊

[@janvimyadventures1310]

What is node* next Isn't it's data type node?

[@janvimyadventures1310]

❤️❤️❤️you are osam

[@anshumankumarnathshahdev3090]

lets make an telegram group to resolve errors i am facing lots of issues too

[@krishanudutta2943]

#include using namespace std; class node { public: int data; node* next; node(int val) { data=val; next=NULL; } }; //Function to insert a node at end void insertAtTail(node* &head,int val) { node* n=new node(val); if(head==NULL) { head=n; return; } node* temp=head; while(temp!=NULL) { temp=temp->next; } temp->next=n; } //Function to print the linked list void display(node* head) { node* temp=head; while(temp!=NULL) { cout

[@rameshmalhotra9525]

kzbin.info/www/bejne/qnK0en6bZbp6fpY

[@chillegaming1837]

For those of you complaining that they can't understand from this video (majority), it's honestly your fault, you dont have your previous concepts cleared, nor you people know the basic terminologies 🤣, watched this video for the first time, grasped everything in one go ! Ab ye thodi na ki Linked list padhana hai, toh ye bataye ki what are pointers, arrays, constructors, OOPS, etc...

[@user-uknzaus]

exactly mene v kaafi negatuve comments dekha to lga yrr .... but explanation was pretty good

[@nazibuddin480]

What will we do with animations when most of us cant understand any thing??? this is what you call the best course??

[@artificialintelligencestud1684]

My favorite in KZbin you Madem

[@dreamdu3055]

0.00 intro of algo 5:23 insert at tail 9:20 display 11:37 insert at head 13:30 searching

[@examway8157]

I get your every point easily bcoz your way of teaching 👍

[@rishiremju]

Very good explanation. Thank you.

[@mohitparker8602]

thank you its really good explanation its fast paced but still helpful don't see other comments its just not meant for begineer they cant comprehend to it

[@ManasD01]

Best Vedio only one con was that , before ending vedios scroll the code from top to bottom slowly so that we can note it easily

[@clashchamp2844]

Increased my confusion even more🙆🏻‍♂️😂🤣 why did I choose to see this vid🤣🤦🏻‍♂️

[@dhairyshrivastava]

this is literally superb !!! I was having error writing the code , and few channels only covered only the concept part and left the code . the other problem was most channels have used malloc fn .I skipped c lang and was having trouble to write the code in cpp using new. Thanku so much

[@diwanchand9764]

I can help you

[@bishnupadadas4842]

​@@diwanchand9764 yes

[@adityabhandari6688]

I had to watch this video twice at .75 to understand the topic

[@anavchug2140]

She is running so fast through the whole video and assuming we understand every line of code, and not deliberately putting in effort to explain.

[@gauravroy4748]

Osmm mam... What an explanation..meko bht achchhe se smjh aya 😊

[@anuragpandey3341]

Now this is the beginning of intermediate DS........arrays and string were elementary level DS.

[@amans124]

Finally After 6 months I know How to Implement Linked list🙂🙃

[@akshaykumar192]

😂

[@vagabondfoodie5788]

Bro any source through which I can learn linklist literally I am facing a lot of problem 😫😫😫😫😫😫😫😫

[@amans124]

@@vagabondfoodie5788 Just revise Classes objects and pointers in c++ to understand structure of linked list

[@roshanrawat9361]

Her way of teaching is very comolex

[@roshanrawat9361]

Complex

[@incrediblejava]

This series is for who are preparing for placement interviews not for beginners means it is for 4th year students.

[@webseriesworld1791]

It takes 15 minutes less than 2 hours to understand this stuff !!!! Even i know a bit about Linked List Earlier Its a Good Revison for me and also a Preparation !!!!

[@motivationrock2094]

Understood mam🥺😳😳 thanks soooooo muchhhhhh

[@guptasitanshu]

Comment section of videos always saves my time ❤

[@iamdj8540]

this series is not up to the mark bro very difficult for begginers to understand no use of animation cant understand a thing i have started to use it as a referance to what to study next and nothing more

[@footballcrazz4355]

If you are referring to the beginning of this topic than Strongly disagree, I was able to grasp alot although it is my first time but if you are referring that this as the beginning of this topic in programming then first you should start off with arrays, this is a bit advanced

[@pranalishyamkuwar6691]

i completely agree :(

[@iamdj8540]

@Hungama Toons no bro its about the way they explain its not easy to understand they claim it is the best course for c++ but i don't think so.

[@abhinavmishra9323]

bro go for saurabh shukla's paid course , it will take time, he will only teach you about 10% of what this course is teaching you, but after that, you will be on another level because unlike these guys , he gives problem in one class and discusses only when students are unable to figure it out themselves. SO he gave us linked list concept and we have to come up with code the next day. This takes time but it increases your level like anything. But do this course side by side also.

[@hemantsudarshan2477]

Bro, you got my point!!

[@rebeccanunes2854]

This was sooooo helpful. Thank you :)))))))))))))))))))

[@ImPushpendraPal]

ma'am aapne kafi acha explain kiya hai thanks

[@sudeepbhagat5027]

Mam apka na "thoda thoda "bolne ka jo andaj hai woo mujhe bahut pasand aaya

[@jobsalert24pk61]

Very very helpful 👍 lovely 😍

[@abhinavmishra9323]

There is another full oop way to do these data structures in which we make all the functions as member function of class linked list and make another structure node as the private member of the class.

[@sherazali8691]

This is what I was thinking about when She created node class with lowercase n. 🙂

[@sakshamjain1717]

Literally today I understood why people say learning DSA is tough ,, definately they are learning from these tutorial I would suggest beginners to go for a channel or video where you make understand each basic thing

[@mrboon8856]

Guys if you don't understand this video , please mark my word ,ye video beginner ke liyea nahi hai , please kahi aur se dek lo , but dukhi na hona ,jab aap padh lena to yaha se revision karna ok

[@sahilsawal]

Awesome Maam :) 🔥👌👍😎😇👏✌🙏

[@iamsus3144]

thx for the video the video helped me so muchhhhh live long didi and aman bhaiya

[@Gaurav-fb9ds]

I have never seen such a Superb video understood every thing and now going to crack all product based companies.

[@indiraparajuli9715]

This video time and space complexity is O(n^100). Didn't understand a bit. And you are gonna crack all product based companies 😜

[@yupp_harish3936]

🤣

[@Newton.968]

Bhai crack kiya kya product based company

[@AbhishekKumar-ue2qx]

I think there should be discussion on how to insert between the two nodes of linked list

[@sionchowdhury2198]

hey bro just wanna give u a tip, imagine linked list as a train, thats it

[@yashvats824]

@@sionchowdhury2198 train is doubly linked list

[@someshsangwan5302]

@@yashvats824 ohh

[@rameshmalhotra9525]

kzbin.info/www/bejne/qnK0en6bZbp6fpY

[@DJ-jf4qg]

feeling blessed when everthing is clear in first watch

[@arjunyadav-kt5jr]

Kitni saaf boli hai mam ki❤️

[@mdimranhosen6674]

Thanks You so much.Your tutorial make me happy.

[@harshpatel2090]

Best series for intermediate Programmers

[@adityajoshi3922]

i did not understand anything when i saw the video for the first time but after watching the video 2/3 times i am getting the hang of it thank you for posting such content

[@giggleglyphs]

Check simple snippets dsa series

[@amayatre3558]

Bss isiliye mai video dekhne ke pehle comment section me aata hoon 🤯

[@tanishasethi7363]

🤣

[@PlayShaban]

Mene codes ko ratta maar liya tha, 20 days practice kiya and now I totally understand. I’m able to write codes to insert and delete the elements by my self. Linked list is nothing but, “Adding more objects to any class and linking them by using pointers”. That’s how memory can be dynamic.

[@abhinavmishra9323]

here's an advice: Don't look at solution without giving a try . Understand the concept and try to code yourself. Then you will have no issues with this course.

[@internetwithsahir]

Thanks 👍🏻 love from Pakistan 🇵🇰

[@suryanshurana766]

Its better to make long videos like saurabh shukla sir or durga sir than short quick music videos but I salute to your efforts.

[@sheetaljadhao9067]

No one can explain like saurabh shukla. That man is on another level.

[@DawoodRizwan-k7f]

Array and link list is so easy...

[@philosphize]

This was most awaiting, I always get confused to solve link list problm, hope I can now understand this properly and solve the problm

[@harshpanwar1550]

Thank u very much Ma'am...🙏

[@anmoldhiman3771]

complete insertion in linked list of all type. #include using namespace std; class node { public: int data; node *next; }; void print(node *head) { while (head != NULL) { cout data next; } cout data = val; temp->next = head; return temp; } node *insert_at_end(node *head, int val) { node *p = head; while (head->next != NULL) { head = head->next; } node *temp = new node; temp->data = val; head->next = temp; temp->next = NULL; return p; } node *insert_at_index(node *head, int val, int index) { node *p = head; node *temp = new node; temp->data = val; int n = 0; while (n != index - 1) { head = head->next; n++; } temp->next = head->next; head->next = temp; return p; } node *insert_by_value(node *head, int val, int check) { node *p = head; node *temp = new node; temp->data = val; while (head->next->data != check && head->next != NULL) { head = head->next; } if (head->next->data == check) { temp->next = head->next; head->next = temp; } return p; } int main() { node *a = new node; node *b = new node; node *c = new node; a->data = 1; a->next = b; b->data = 2; b->next = c; c->data = 3; c->next = NULL; print(a); a = insert_at_begining(a, 4); print(a); a = insert_at_end(a, 5); print(a); a = insert_at_index(a, 6, 2); print(a); a = insert_by_value(a, 7, 6); print(a); return 0; }

[@indiraparajuli9715]

Wow

[@jyotipandey3156]

N coz of uh people..we knw that .. quality content...is stilll available free of cost...in this xpensive world❤️❤️❤️❤️❤️....❤️❤️❤️❤️ thanks a lot❤️

[@nishithkotak5002]

Thanks for such amazing videos. Can you plz share the notes and code of the playlist for learning purpose. Thanks

[@sourabhpatil1392]

Very Nice Videos....

[@raman015]

Your explanation is too good I understand very well if anyone who want to understand this video then watch maximum 3 or 4 times and implement this code also 2 or 3 times

[@PiroCoder]

kiskisko samajh nhin aaya

[@DTALKS01]

Ek bari me nahi aayega ..... Har line of code ko Break down Karo and 4-5 baar baad aajayega

[@aniketdev1157]

​@@DTALKS01sahi kaha

[@zakryashakeel1883]

mujy nh smj aa ya koi samja do

[@zakryashakeel1883]

​@@DTALKS01ap ko ya smj ha? kindly mra kituch douts han vo solve kara dan

[@syedmuhammadabdullah2920]

ye bskwas samghati hy

[@maheshbk-dh1co]

best..in the internet

[@ritwikchawla9000]

Kuch samaj mai nahi aaya prr sunke acha lagga 😁😂🤣😁😂🤣😅😆 @Apna College

[@salikansari8981]

Finally, understood linked list after 3 days of confusion.

[@0070vishal]

apni kaksha's only starting videos are good. if youll follow this whole playlist step by step youll get demotivated

[@arpitk5912]

same bro..are you following this course?

[@0070vishal]

@@arpitk5912 was. i stopped

[@arpitk5912]

@@0070vishal so following something else or what

[@0070vishal]

@@arpitk5912 still looking bro. doing some questions and some videos watching from youtube

[@subhamsingh_cse6310]

While watching this I thought I am the only one who didn't understand whats going on😂then I saw cmmnt section... Alag rahat mili

[@shirgaonkarved3780]

while code implementation ,if the process of implementation like what's happening behind the code in memory is shown visually with help of diagram it will be more helpful

[@harshpatel2090]

Its a very nice idea

[@smritigupta1468]

She actually teaches very good

[@djrockzz1163]

Indian Hindi : Mujhe!! Hyderabadi Hindi : Merko!! In English its : To me

[@calmyourmind5617]

I am from a non cs backgrnd and I can explain more clearly than this. She did not explain the underlying concept behind every move she made. It is not easy to explain linked list in a clear manner. It takes longer time than this video length. Anyone who tries to understand from this lecture will end up hating the concept. But it is very easy if you learn it in a clear way.

[@ardhendudas1834]

Aman bhaiya is doing great work also our teachers are great . Thank you team...

[@avians7335]

It took me 3 hours to understand the video. But now I have understood every single concept of it 👍😇🤟

[@aryandas1129]

Please give your mail / whatsapp number

[@sleepypanda7172]

same 🤟

[@avians7335]

@@aryandas1129 kyu bhai?

[@chanduchandrakanth5131]

Bro, she did not taken any value in constructor node(int value)

[@sapnadipbaidya7757]

people who cant understand plz read basics of cpp. these are easy to grasp but iff youknow basics of cpp

[@devashish7724]

Such a nice video....learnt something interesting

[@shivamsingh20]

very good explanation di.....

[@dibyajyotimahuri907]

Thank u so much for this course bhaiya

[@karanrai6772]

I am also

[@pritishpattnaik4674]

mam , plz make a video to insert a node at a given position..

[@Zaib-j7i]

this video is strictly not for beginners 😂

[@saqibsyed1014]

You made it so clear that I think LL is the most easy concept in DSA hhaha

[@molviwithskills]

😂😂😂 what a great lie

[@saqibsyed1014]

@@molviwithskills Not lying. I got the whole concept.

[@humdaanmirza8963]

Ever thaught why array over linked list ? beacuse array is cache friendly it is a contigious block of memory and lineked list is scattered in memory so when elements of array are accesed maney times it is stored in chache memory by operating system to improve efficieny of program but o.s cannot put nodes of linked list in cache memory beacuse theuy are not contigious This allocation cache memory is called locality of refrence which is there in array but not in Linked List . Happy lerning :)

[@SARTHAK_K._PATRO]

Animation shud have been given by displaying nodes...you could take inspiration from log2base2

[@kazamali910]

Thk hai yrr 😊

[@hyper8x8]

This video is good if you already know 80% of linked list and this will clarify your rest 20%. But if you don't then you will understand nothing.

[@SatyamKumar-pd8qy]

Thik hai😄😍❤❤

[@iamnoob8298]

Aman bhaiya android app development ka bhi course daal dijiye naah hum bahut aabhar ❤️❤️

[@avinashchaurasiya6497]

pls, make it beginner-friendly.👏

[@jaunabbas5484]

those who not understand this hope one day u will get it

[@sujalgupta2325]

good content and way of delivery is appreciable

[@balleballey]

Nice explanation

[@dreamdu3055]

It is hard to understand but not impossible I watched 5 times than I got things Focus on Next Data and head

[@sumitpanchbhai6280]

#include using namespace std; class node{ public: int data; node* next; }; void display(node* n){ while (n!=NULL) { coutnext=second; //a pointer pointer to next pointer second->data=20; second->next=third; third->data=30; third->next=NULL; display(head); }

[@veekysoft]

Ultimate discription.

[@bat_man1138]

Bas yahan se khel shuru ...isse pehle tak trailer tha🙃

[@cenacr007]

guys do not panic this whole playlist is for question practice not theory if your theory is not good or clear then please go somewhere else like NPTEL and then come here to practice questions otherwise you will regret it...You need a proper foundation first before you can practice questions.

[@kunaldeshmukh2988]

It's perfect 🔥to understand linked list properly,thank you for the wonderful video 😀well animated,well described and complete knowledge...

[@kartikverma8070]

why we are taking adress of head in insertattail fuction but taking directly head in display