Doubly Linked List - Implementation in C/C++

See complete series on data structures here:
• Data structures
In this lesson, we have implemented doubly linked list data structure in C. We have written basic operations for traversal and insertion.
See source code here:
gist.github.com/mycodeschool/...
Lesson on Dynamic memory allocation:
• Pointers and dynamic m...
For practice problems and more, visit: www.mycodeschool.com
Like us on Facebook: / mycodeschool
Follow us on twitter: / mycodeschool

[@kunal1035]

8 years passed by and this channel is still helping thousands!!

[@knanzeynalov7133]

exactly, even in 2023.

[@DhivyaGnanasekar]

Yes

[@sahelisohanitwins7492]

2024 also

[@Hello_world807]

10 years passed by and this channel is still helping thousands!!

[@nguaial8490]

I just want to mention that I really appreciate you repeating the important concept over and over again. I don't know about the others, but I really have hard time grasping the memory structure concept inside a computer since I haven't seen one. The only way I get it is when I look and listen the subject repetitiously.

[@kevincaasi926]

This is beautiful. Thank you for taking your time and effort in explaining how to implement doubly linked lists as well as their actions on the different memory locations. You possess great pronunciation, clarity, knowledge, and appropriate talking speed. Thank you!

[@pranavofindia]

lets watch the complete ads without skipping and appreciate this man.

[@navkaransingh3948]

@ how ?

He died in a hit and run. Someone hit him with his/her car and ran and drove off.

[@lasyagajavelli594]

really..?

[@standardgu3773]

@@lasyagajavelli594 I want to know the truth....

[@lasyagajavelli594]

@@standardgu3773 I don't knw either...wherever he is he has to be happy

[@kanishkjain2767]

wow sir finally i understand why we are using dynamic memory allocation instead of normal allocation i know you cant read any of our comments but still i want to say that u will always be the best teacher not only for me but for most of the online community who are still watching and learning from your videos

[@mymanhapt]

It's the best "data structures" tutorial list I've seen in the planet !

[@zeeshanayub9706]

Sir, I can't even express how helpful your tutorials are to me. Thank you so much for making them!!

[@antor.morsalin]

There is an easier way to print a list in reverse. We can always store the address of the last Node in the variable Node* tail. Tail will change depending on which Node is at the last position each time we add a New node in the list. We can start at the Tails and using the previous address we can print the list in reverse order, This way we won't have to iterate the entire list before printing it in reverse. I also want to say this is a great video series. The clarity I got on this topic just after watching it once is insane.

[@justdanaus]

I don't know why my professor can't not explain this easy as you do! I really hate pointer until I found your great video. You got new subscriber!

[@monicaslv323]

Thank you for every codeline of yours.

[@scotfsh5014]

Thank you so much humblefool, you make the world a better place.

[@Facttoknowabout]

10 years passed but this channel is helping students now also .

[@TheHyperActiveRedditBot]

Your way of communicating an idea is near perfect (unlike most other coding youtube channels). Keep up the good work.

[@knanzeynalov7133]

@@mahedihassanshawon4821 are you serious????/

[@hassan4834]

You have done a great Job ! You really made things easier to understand.. Lectures like this are very hard to find on internet hats off :)

[@bhavanababua959]

I cleared my technical interview after watching these video. Thanks for uploading these clear and precisely explained videos.

[@dheerajdhall8482]

Thank you for taking out time and making these videos. I really like the way you explain these concepts. Cheers!!

[@raduchirilov4800]

This is the very definition of a "clear code" Thank you so much!

[@maliksaraanasim5404]

Yaar bhai tum saviour ho,I can not thank you enough .Seriously.

[@firkyunbanaya]

Watching this video lectures should be made a part of the College curriculum.These videos helped me a lot during preparations for Exams.

[@pcpardon]

Impeccable explanation!!! Cleared all the doubts what I had. I have no words to say thanks..

[@anusrees3991]

this is the frst tutorial in which i see things explained via code, graphical representation and memory allocation process

[@renelhomere5243]

Thank you so much, you've help me get through the portion of class. 👍🏾👍🏾

[@danielabonvini2936]

Thank you, finally getting to understand how DLL work

[@meghamalviya8495]

BEST Tutorials of DS...excellent explanation...supreme clarity and knowledge

[@TheFlexath]

the best data structures playlist ever!

[@user-re8bl1nu8y]

this is the best DS video i have ever seen

[@thestarinthesky_]

@3:13 BLOWS MY MIND! Impressive! Thank you.

[@AlphaZubair]

10 years passed by and these explaination of concepts are Just like a WoW...

[@ucthuanphung4530]

Videos are extremely clear and useful. Thanks a lot.

[@shobhitrealm]

RIP man, even though you are no more your videos are still helping us all.

[@KeshavUjoodha]

He isn't dead. His name is Animesh Nayan . His friend Harsha Suryanarayana is the co-founder to this channel and he is no more. He died in a car accident 15th June 2014. Animesh Nayan is a Software Engineer at Google. "Harsha was the best coder India has ever produced. He was working in a start-up (that he co-founded with Animesh Nayan) MyCodeSchool. He was alumni of Indian Institute of Information Technology, Allahabad. We lost him in a hit and run accident on the night of 15th June 2014." [Source: fossiiita.github.io/humblefoolcup/humblefool/humblefool.html]

[@gamereplayhq]

is this a good approach , i just included a constructor which set next and prev to NULL , so that we dont need to worry about setting up next and prev while inserting a new node ? struct node { node *next; node *prev; int data; node() { next=NULL; prev=NULL; } } *start=NULL,*temp,*end=NULL; void insert_beg(int x) { temp = new node; if(temp==NULL) exit(0); temp->data =x ; temp->next=start; if(start!=NULL) start->prev = temp; start=temp; if(end==NULL) end=start; //initially } is this a good approach ? since now we need not worry about next and prev being NULL , since they would by default be pointing to NULL ... ?

[@lucafrazz6199]

Very awesome! I don't speak english very well but i have understood all... this is a very nice tutorial.

[@aryannijhawan8448]

u said u were gonna talk about circularly linked list . This is really an amazing playlist I wish this was more comprehensive. Thanksss :)))

[@asmereg]

Such a great teacher! Please come back

[@arukoul6364]

Thank you so much, your videos are really very nice for learning Data Structures. Thank you, Sir for this beautiful learning gift.

[@rabinrai5838]

sir where is the video for circular linked list????? and thanks for ur videos helping me a lot

[@arpitj795]

thank you for making things simpler.

[@mohitsrvv]

many years but still watching thanks

[@abhirupbasak5035]

you guy just amazing ..even my teacher can't explain like this

[@Maurin4000]

best explanation so far, thx a lot

[@manansatra]

Hi, you said that the newNode in GetNewNode is local to GetNewNode but previously you mentioned that the output or the node we get from the malloc function or new Node is global and so the newNode variable were we store the result of malloc should also be global. I am confused and the statement seems contradictory to me. Could you please help me with my confusion? Thanks.

[@roopanrodin7924]

Thank so much for the lesson. It was very useful, thank you a lot

[@oscarwang7920]

wait , so by the way you insert node, after the second and third insertions, the order will actually be " head (which is the third insert node) -> node (from the second insertion) -> node( from the first insertion) " Therefore, you are always making the new insert node as the first one in the list but not the last one ? Can anyone tell me what is the standard way or most common way to order the double link list when it comes to insertion ?

[@kuonkhailechdawech2309]

You're legend brother 🙏

[@poojagoyal869]

One of the best tutorial...thank you sir...

[@DiogoNeves]

This is brilliant! Thanks! :) You don't talk about deallocating the nodes after we're done with the list. Shouldn't that be done explicitly since we allocated them in the heap?

[@Mhmoudko]

Thank you man , you're a life saver ...

[@sreekumarmenon]

isn't it more efficient to have a tail pointer (similar to head pointer) to traverse backwards?

[@mycodeschool]

We may or may not keep a tail pointer. Its good to keep a tail pointer, depends upon the use case. When we implement queue using doubly linked list, we keep a tail pointer. But in general, if we would have two links - forward and backward, that's what we would call a doubly linked list.

[@findoc9282]

Bro thank you so much and I wish u had good life up there

[@CODINC]

Absolutely Amazing man!!!

[@Rizzan8]

Wouldn't the use of malloc and not using free() cause a memory leak?

[@Christine-ne3dw]

Thanks, I appreciated this a lot.

[@wannabe.explorer]

cleared my concept..thanks sir!!

[@ricardohincapie1537]

Thank you very much for this video. It is really understandable!

[@ChauTran-mh5qo]

Hi bro, When you implement the function "InsertAtHead(int x)", why don't we use the following implementation //********* head -> prev = newNode -> next; newNode -> next = head -> prev; head = newNode; //********* I know that is incorrect, but can you help to clarify my misunderstanding. Thanks and Regards,

[@Nino-bd7bp]

OMG thank you very much!!! This really helped me :)

[@TheDigitalPedia]

Great stuff you guys are producing i must say. Have you guys posted videos on priority queues+heaps and Graphs?? If yes so any link you can provide?

[@RatIceCream]

Thanks for uploading!

[@ainmiky4620]

Hi i want to create a singly linked list in C with 4 nodes. The first two nodes should contain strings and the last 2 nodes should contain numbers (int). I know how to create a linked list with integers as data types, but I don't know how to input strings into the nodes. Can you help me?

[@mattm32]

Thanks you for this wonderful video, how do we modify the code to use it us generic list, i try to use void pointer but i got an error on type casting it bc the data types can different in the same list? Thanks again!!!

[@harshitsoora1313]

awewewewesome bro ,you have superb teaching experience ,aise hi machatte raha

[@RajahChandrasekhar]

Best tutorial ever!!!

[@095_shaniabalkhi9]

Great explanation!

[@akashdeep504]

please upload some lectures on dynamic programming

[@vijaymalawadkar6830]

Thank you for easy explanation of linked list

[@yichizhang795]

Good work sir, Thanks!

[@pulkit0581]

thanks alot. This is very helpful. Please suggest how should i proceed for preparing competitive programming after going through all the data structure series and others available on mycodeschool

[@sagarvyas304]

in the 8.52 mins of the video we see how to add a new node to the non empty list. but we write 1.head->prev=newnode; 2.newnode->next=head; 3.head=newnode; so my question is can we write newnode->next=NULL; instead of the 2nd statement?

[@MOHDNAVEED1]

awesome compilation

[@machinelearning3518]

i'm grateful for ur video

[@muathkifaya9582]

hallo , if we want insert data at nth position in doubly linked list , How do that ?

[@mashable8759]

All the tutorials are the best and really helpful :D MAY ALLAH GUIDE YOU

[@shobhitrealm]

He is no more. He died on 15th June 2014.

[@muktamalakar5771]

Fuck off dude, if you want to believe in 7th century bullshit, don't use technology and watch these videos.

[@yogabrindha5640]

Clean explaination

[@lilianawong4819]

When the new node was created with the address 600 was it suppose to be | 0 | 4 | 0| ?

[@daoanhtuandao8106]

your videos are helpful .I learned more good knowledge .

[@antoniomellobabo1229]

Thx helped a lot!

[@antragupta1001]

sir always u say thanks for watching ..today I m saying thanks for making ......I can't tell u how relieve I m feeling after watching this ..... cz tomorrow is my exam ... 😍😍😍

[@koulicksadhu7679]

Sir is no more

[@drewpatton4275]

You are a saint.

[@shivanshbhardwaj5841]

Great video!!!!!!!!!!!!!!!!

[@malazalzarrad6064]

you are the king

[@w4h175]

hats off sir ji..

[@nehagurav312]

very helpful! thank you!

[@usama57926]

this tutorial is amazing

[@mirzaavez6284]

Thanks sir for explaining this topic

[@Credi44]

can someone explain whats the difference between using while(temp !=null) and while(temp->next!=null)? they seem to give the same output either way

[@hell-bringer]

what is head at 7:13 ? Is it of type struct node ?

[@prakashkhare2824]

sir i implement function for the insertion at nth position,in forward function it print but in the case of reverse print it doesn't print the element of nth insertion InsertAtN(int x,int n) { Node* temp = GetNewNode(x); Node*temp1 = head; for(int i = 0; inext; } temp->next = temp1->next; temp->prev = temp1; temp1->next = temp; Node* temp2 = temp->next; temp2->prev = temp1; }

[@stevejerry808]

really solid thank you

[@anandsatija6172]

guru dronacharya of data structure :)

[@suhailaijaz7085]

anand satija 😂😂😂

[@MrBomer213]

hello thank you foe the video its awesome! i have a question and its killing me, at 8:32 you're inserting InsertAtHead(2) and InsertAtHead(4) but in your drawing you have '2' in address 400 and '2' in address in 600 did you mean to put 4 ?? or are we replicating the Head with the val 2?

[@ishanpand3y]

he mistakenly wrote 2 instead of 4

[@r3fl3xplays36]

could you please make 1 video regarding efficient doubly linked list (using XOR operator). it isn't available on youtube.

[@koulicksadhu7679]

He is no more bro

[@ankittarway6018]

very helpful !!! thanks a lot

[@bleep4930]

awesome videos broh..thanx a lot..how do u writ em ? lik wat software do u use..or what device ?

[@bilalqadri5312]

very helpful tutorial ❤❤❤❤❤

[@thesimulatedcreator6187]

Is it necessary to initialize head as NULL in the main? Can't we just initialize it as NULL just when we declare it?

[@MrFalcon58199]

can someone tell me where the main function in memory is? when I read my college books on one page it says it's in stack, on the other page it says it's in code segment

[@Drwildy]

3 Years late, It is on the stack.

[@kalyankumard2243]

Here memory is not deallocated from the heap memory, it does memory leak, how to avoid the memory leak in the linked list (single and double linked list). when do i deallocate the memory from heap area.

[@46_wrtyui]

Very awesome class. But please reduce the time on the difference among the memory sections since it already introduced several times in previous lessons.

[@yashkothari7540]

Also what do you mean by : head -> prev = newNode; newNode -> next = head; head = newNode; should we not write : head = newNode; newNode -> prev = head;

[@tomasz-rozanski]

If you insert newNode at head, newNode->prev will always point to NULL because it's now first element in the list (a new head). The old head is becoming the second element of the list, that's why newNode->next must points to it and head->prev points back to newNode. In your example head will be equal to newNode, newNode->prev will point back to newNode itself and newNode->next is already NULL. This way every time you're inserting node at head you're really throwing away the old head node so the list will always have one element - the last one you have inserted.

[@siddharthmagadum16]

Thank you very much... 👍