Doubly Linked List (Insertion at the Beginning)

Data Structures: Inserting a Node at the Beginning of a Doubly Linked List
Topics discussed:
1) C program for inserting a node at the beginning of a doubly linked list.
Data Structures: bit.ly/3hjudFV
C Programming: goo.gl/7Eh2SS
Follow Neso Academy on Instagram: @nesoacademy(bit.ly/2XP63OE)
Follow me on Instagram: @jaspreetedu(bit.ly/2YX26E5)
Contribute: www.nesoacademy.org/donate
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy.org/recommende...
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#DataStructuresByNeso #DataStructures #DoublyLinkedList #LinkedList

[@karthikj14]

You Guys make things easier...

[@dipeshsamrawat7957]

I love Neso Academy :)

[@01.abhishekkumar33]

Awesome lecture sir

[@sd12217]

Sir plz complete the ds playlist your videos are really awesome

[@arthia2801]

A very big thank you sir

[@arthia2801]

A beru big thank you sir

[@divyanshbalodhi5642]

To the point teaching

[@bbpharma3075]

Sir these videos are helping a lot because they are very understandable and you go point to point , I would request you to pls increase your speed of uploading videos because I would really like to keep up my course alongside your tutorial ,so that i am always updated , pls try and cover trees after this and then stacks and queues, if you can pls🙏

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@abbikgg3992]

@@amlansasmal Yes, of course we can. We can create head flag inside the main function, but we usually create structs globally, so that every function can reference it

[@sohelansari-dq5kv]

Thank you sir for uploading this video...it's very helpful

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@yusraansari8320]

Thanks a lot for these videos !

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@abouhashim100]

thx. for the incredible series of videos. but didn't we suffer from memory leak because we didn't free the space and pointers created throw the secondary functions, and if true how could we do that?

[@kunalsoni7681]

Really very helpful video 😊 too much 🥰😍

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@tejatej3628]

Thank ❤u sirr for ur quick response

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@rishikadhakad1133]

@@amlansasmal yes we can create

[@explorerars4208]

wow sir

[@shivamprasad4560]

thank you so much sir for videos....plz upload more videos

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@sabbysays]

Thanks for the great explanation sir. But please increase video frequency 🙏

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@sudeepmulumudi]

helpful videos ,,,,do more

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@_nabin_8848]

Actually we can. For that you can try this code: #include #include typedef struct node{ int a; struct node *p, *n; }node; void add_node(node **p, int a){ node* temp=(node*)malloc(sizeof(node)); temp->n=NULL; temp->p=(*p); temp->a=a; (*p)->n=temp; (*p)=temp; } void out(node *p){ while(p!=NULL){ printf("%d\t",p->a); p=p->n; } } int main() { node *head=(node*)malloc(sizeof(node)); head->n=NULL; head->p=NULL; head->a=10; node *current=head; add_node(&current,20); add_node(&current,30); add_node(&current,40); current=head; out(current); }

[@techknowgemes7860]

sir does here ptr prev will contain null ?

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@thewolverine5591]

🙏

[@shafarazkhurshid2909]

nice expalnation..

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@dsdcp]

can any one save me some time cause i have forgotten why did he put a pointer "ptr" to receive "head" to the loop??? why do not do it straight with "head"?

[@shubhammandal6735]

It will overrite the head so they are using a ptr Node to mimic the head.

[@anotherfella7140]

2:13

[@SUBHASHKUMAR-ix5mz]

Please make your c and Data structures video in hindi constant

[@lexingtonjackson3657]

if you are in college you should watch in english so that you will be able to explain the terms efficiently in your future interviews,just my opinion.

[@SUBHASHKUMAR-ix5mz]

@@lexingtonjackson3657 thanks ❤️

[@kajalmondal9745]

Sir how can we create memory efficient doubly linked list?

[@shivp436]

All linked lists are memory efficient, and that's one of the main reasons we use them. They are efficient and dynamic. 👍

[@hetaeramancer]

@@shivp436 sometimes arrays are more memory efficient

[@vengalrao5772]

@@hetaeramancer it's hard to data structures na ? Trees , etc in c language

[@amlansasmal]

i have a question .... like in singly list we can create node inside the main func .. so can't we create that head node in this doubly linked list inside the main finc ?? please clear my doubt !

[@sapnap2468]

@@amlansasmal tell me too if u got the ans..

[@pratikwakati7023]

Is the code given even works?

[@devakinandan23]

where the fuck is malloc in code?

[@bananas_5856]

Is right there lol

[@_nabin_8848]

My approach #include #include typedef struct node{ int a; struct node *p, *n; }node; void add_node(node** p, int a){ node *temp=(node*)malloc(sizeof(node)); temp->p=NULL; temp->n=NULL; temp->a=a; (*p)=temp; } void link_node(node *n1, node *n2) { n1->n=n2; n2->p=n1; } void out(node *p) { while(p!=NULL){ printf("%d\t",p->a); p=p->n; } } } int main() { node *node1,*node2; add_node(&node1,10); add_node(&node2,20); link_node(node1,node2); out(node1); }