2.10 Implementation of Doubly Linked List - Data Structures
ฝัง
- เผยแพร่เมื่อ 16 ส.ค. 2019
- We will see how to implement a Doubly Linked List with code.
DSA Full Course: https: • Data Structures and Al...
******************************************
See Complete Playlists:
C Programming Course: • Programming in C
C++ Programming: • C++ Complete Course
Python Full Course: • Python - Basic to Advance
Printing Pattern in C: • Printing Pattern Progr...
DAA Course: • Design and Analysis of...
Placement Series: • Placements Series
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
DBMS: • DBMS (Database Managem...
***********************************************
Connect & Contact Me:
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/profile/Jayanti...
Instagram: / jayantikhatrilamba
#implementation, #implementationofdoublylinkedlist, #doublylinkedlist, #jennyslectures, #linkedlist, #datastructures
![[SUB] 베몬이 교관님 멘탈을 탕탕 후루후루~٩(๑❛ᴗ❛๑)۶ FOREVER 웃게 되는 갓기들의 수련회 | 돌들의침묵 | BABYMONSTER(베이비몬스터) 'FOREVER'](http://i.ytimg.com/vi/FISAO7BwIxE/mqdefault.jpg)
Jenny, you are an amazing Professor! Your lessons thoroughly cover material my professors take 2 hours to explain but many of my classmates remain confused! A huge thank you to you! I'm SO glad I found your channel! May your channel have more successes. Sending my best regards from Los Angeles, CA.
Thanks mam for the explanation...and also mam your skin is flawless 💖
I hope she may become santoor soap ad ambassador in future. Madam son will come by saying mummy then the advertisement starts.
Ma'am , Very Unique explanation, Thank you for ur contribution. U are doing an amazing work, May God Bless You
We should implement head out of function Create cause if we implement inside, when we call that function it will get value of head = 0 and we will loose all the nodes.
bro, i was trying to figure out why my code wasn't running well from last 1/2 hr and you saved my life.
Bro can you provide source code please it will be helpful!
@Upmanyu Gaming plz give
#include
#include
struct node{
int data;
struct node *prev;
struct node *next;
};
struct node *head=0;
struct node *newnode;
void create()
{
struct node *temp;
int choice = 1;
while(choice)
{
newnode = (struct node*)malloc(sizeof(struct node));
printf("Enter the Data");
scanf("%d",&newnode->data);
newnode->prev=0;
newnode->next = 0;
if(head ==0)
{
head=temp=newnode;
}
else
temp->next =newnode;
newnode->prev = head;
temp = newnode;
printf("Do you want to continue
");
scanf("%d",&choice);
void display()
{
struct node *temp;
temp = head;
while(temp!=0){
printf("%d",temp->data);
temp = temp->next;
}
void main()
{
create();
display();
}
}
}
}
plz tell me why it not running
Quality teaching as always. STAY BLESSED!!!!
Best Lecture in Data Structure and Algorithms till now..
Thank u mam. This video helped alot in understanding the concept of doubly linked list which I was trying to understand for almost a week
You are great teacher. Very simple easy to understand and very clean way to writing codes. Huge respect ma'am.
One word for this- Amazing ❣️
Best Explanation for engineering students. Great work mam..
Love the way you teach mam❤️
Difficult topics made easy by you for us
Thanks a lot😇
Linked list is now becoming easy
Tq and cheers✌
one correction!!
temp should be initialized outside the create() function because as the function is called repeatedly the temp value changed as it will be reinitialized and the old value will be lost
so, temp should be initialized globally near the head
:)
Is mam code works ??
@@sudheerarigela8202 no
The function is for creating the link list for the first time. So there is no second use of this function, Why would call the create function second time anyway? So mam's code is indeed correct because we don't need the temp globally.
Amazing videos ma'am. As a CSE student, these are really helpful for me.
I am a BA student but your video makes me computer science student. Best explanation!
Very helpful and outstanding video.
May you (mam) live happy and long.
Thank you so much mam.❤️❤️
I start everyday seeing you most probably.
Mam you clearify those thing like a genius.. you're a genius..thank you mam
Mam please show us the total compilation and output in a code editor and make a seperate video because while typing code myself it is not executing at all. Please 🙏😭
same bro, compilation error
You have to make sure that you've the proper knowledge of function with pointer
Actually mam was teaching the logic of the code only for understanding the concept ...and we have to use a proper code when we are compiling in the editor
Ok
Correct the code head=0
I'm gobsmacked to watch your videos mam....you are doing such as a great job ...
Hello Ma'am just now saw your videos on youtube and it was awesome explanation, could you please make a video to explain time and space complexity also...
Yea please
Ma'am your channel and videos deserve more popularity and wider audience. Really thankful for your efforts and happy after understanding concepts from you. My senior suggested your channel and I am from mechanical branch from nit Allahabad so no knowledge of computer science but now I am feeling confident.
The best teacher that i see.
shouldn't temp be globally declared rather than locally as its values will change everytime create is called?
This lecture is very helpful. Thank you ma'am.
Maam your teaching is God level.......fav teacher on youtube
My college is closed because of covid-19. I am learning ds by watching your videos.
They are really helpful.
Thank you
in which year you are?
I'm watching in lockdown...cse branch
Can u please share compiler code ...??
Mam you are the best 😚 I can't thank you enough ♥️ may god bless you 🙏🏽
thank you very much your teaching helps me understand concepts easier
I really appreciate for your efforts mam.Thanks a lot.
the end of the vedio make me smile😊
and thanks a lots mam give me a right knowledge 🙂
It is better to remember pointer to tail node
Queue insertion and concatenation are O(1)
Backward trawversal is a little bit faster because you dont need to find tail node
Mam We have to declare head outside of the function create otherwise Display point to only last node
hi jenny thanks for ur helpful lecture i am form Ethiopia please keep up it
you are Amazing
AoA u way of teaching is absolutely nice and awesome plz Kindly make video on double linked in C++ please.
Mam could you explain about Time complexity on a separate video. And you are just awesome mam, your videos are very helpful and beneficial to us. Thank you ❤
God Bless U mam plz share the Knowledge to needy through Utube.
mam i'm big fan of your teaching method......
you are one of the best teacher in youtube..i have one question...
aapko silver play button mila kya ...????(waiting for your reply: ) )
Thank you ma'am. I'm your student from Bangladesh :)
Thanks mam 😊 ...& Ur smile is adorable ✌
Thankyou so much mam for this fantastic explanation 😊
I love that "Emputy"..
Very helpful video,thank you ma'am.
Actually mam i downloaded your whole series and whenever i completed the lecture I come here every time to like your vedio😄😌
Tq u mam I'm searching for this double linked list implementation and good explanation
Can u please paste the code from compiler.
Mam...ur explanation is much better than my sir's explanation...but please provide notes I mean pdf of the coding part mam please . Thank you:)
Mam I humbly request you to start a playlist on Java and python for beginners.
I like the way to teach and I can connect the concept. There are very less educators in TH-cam who teach in whiteboard and give the feel of a classroom.
hi mam, tq for helpping us .Mam data structure and algorithm i cant solve bcz its difficult for me but now im learning from ur videos
Yes
thanks a lot mam for posting this informative video👍👍👍
Thanks for your good explanation... Mam
Ma'am if I insert nodes at the beginging only then how will I reach till the end of the list and assign the tail?I am trying to reverse a doubly linked list where I inserted nodes at the beginning only.
Mam , your teaching is awesome but there is a mistake, i think while making linked list , you have to also give value to tail otherwise we can't use it in further operation.
Ma'am can we use new and delete operators to allocate memory dynamically??
Ma'am, you teach smoothly and the concepts tend to become clearer as you move forward. Best of works you are doing! But there are frequent ads in your videos, which create problem and disturb the flow.
So trueee after watching each video one after the other, the concepts in previous videos are becoming more and more clearer, love how this playlist works
Mam I have a question in create funtion we r initialising head=0 always the when ever we will call that function r head will have null value ?
Can you make database tuning and query optimization video series?🙂
Really mam your explanation is amazing
In create function you have written head=0. It should be initialize globally??
Ma'am when I am running the code in the output first and last data is not showing only middle data is showing.
Ma'am aap sch me bahut accha pdhate ho i really like✨ your videos especially data structure . I m a bca 2 year student please give me some suggestions 😊
mam upload some video related circular linked list and please arrange the playlist in which order we have to follow.
mam will you please upload notes of each video or topic ..it will so helpful
Mam.. once head ptr is declared globally it means it's intialized with null. Again need not to initialize to null in local functions
Mam can we create newnode =malloc(sizeof(struct node)) since we have already declared *newnode as pointer
Thanks
Real god of datastructure
thanks a lot mam , you helped me alot.
mam i think that head=0 below void create() shouldn't be there.
Can u explain memory efficient DLL pls (single pointer one)
Videos r too helpful ma'am
For anyone who need a code that runs--
#include
#include
int main()
{
struct node
{
int data;
struct node *next;
struct node *prev;
};
struct node *head;
struct node *newnode;
struct node *temp;
head=NULL;
int choice=1;
int count=0;
while(choice)
{
newnode=(struct node*)malloc(sizeof(struct node));
printf("Enter Data:
");
scanf("%d",&newnode->data);
newnode->next=0;
newnode->prev=0;
if(head==0)
{
head=temp=newnode;
}
else
{
temp->next=newnode;
newnode->prev=temp;
temp=newnode;
}
printf("Do you want to continue (0,1)?
");
scanf("%d",&choice);
}
printf("--------------------------------
");
temp=head;
while(temp!=0)
{
printf("%d\t",temp->data);
temp=temp->next;
count++;
}
printf("
Count=%d",count);
return 0;
}
Thank you , this really helps as i got confused
@@hunterxcobby GOOD code, bu u didn't free the memory !!???
@@justcurious1940 I wrote a function that frees memory
@@hunterxcobby Ok show me , and I will show u a nice trick. 🙂
@@justcurious1940 this is it
/* Function to free nodes in a doubly linked list*/
void freeDll(struct Node *head)
{
struct Node *current = head;
struct Node *nextNode;
/* Traverse the list*/
while (current != NULL)
{
/* Save the reference to the next node before freeing the current node*/
nextNode = current->next;
/* Free the current node*/
free(current);
/* Move to the next node*/
current = nextNode;
}
}
Mam I have a question that if in choice I am putting any value(not only one) except 0 then it will permit to add new node
Coming here after paying a Udemy course which wasn't clear. This is much better, thank you.
I agree. I didn't pay Udemy but.....she's awesome !!!
Pls make video on memory management
I have suggestion you can initialize head = 0 outside function so if we need to call the function again, inside function become head = 0 and assigned to newnode and it loose all previous link we have only temp and newnode it can be recoverable even if we lose head by temp itself need traverse reverse to assign head but that complexity we can assign outside function head = 0 even temp also create at outside function if we need to reverse back to get head value
Code :
#include
# include
int main(){
struct node{
int data;
struct node*next;
struct node*prev;
}; //no memory allocated ,declaration only
struct node*head;
head=0;
struct node*temp;
int choice=1;
while(choice){
struct node*newnode=(struct node*) malloc(sizeof(struct node));
printf(" enter the data");
scanf("%d",&newnode->data);
newnode->next=0;
newnode->prev=0;
if(head==0)
{
head=temp=newnode;
}
else{
temp->next=newnode;
newnode->prev=temp;
temp=newnode;
}
printf ( " do u want to continue ( type 0 or 1)?
");
fflush(stdin);
scanf("%d",&choice);
}
temp= head;
printf("items in linked list are:");
while(temp!=0)
{
printf( " %d",temp->data);
temp= temp->next;
}
return 0;
}
THANK YOU .
What's the use of fflush
thnx
Code
mam make video on skip list its insertion and deletion process
amazing explanation ma'am !
Mam love this your teching
Simply awesome ❤
madam instead of using while loop u directly stored the address of last node in temp but plz tell me when create function completes then automatically temp variable will be lost because u declared it within the create function so it becomes local. then next time when create() is called how temp will able to hold address of last node? i think it will not work until we declared temp globally
Mam simply keeping" head->prev =0 in if condition is enough know" what is the need to keep on assingning it with 0
temp is a local variable and will be deleted after the function call is over. So to insert 3rd node, I'm skeptical about this logic.
Temp pointer should be decalred globally outside the function to preserve the value of temp else it would be deleted when the activation record of the function is deleted after completion of the function.
Thank you ma'am for these lectures
Yes bro it's same thing
beauty with brain awsm teacher
Very nice explained ma'am
We are understanding you lecture mam thanks mam
miss the linked list node that you have created in this video
is more or less inserting the elements at the end;
Ma'am pls make a video on how can core atudents or rather any student can prepare for their placements.
madam jo aap ne if condition likhi hai woh shayad thodi si galat nahi hai kya?? kyunki mujhe lagtaa hai jo apne head=temp=newnode kiya hai usemin phele keval head=newnode denge phir else condition mein alag se hum temp=head denge kyunki agar head null nahi hai toh kabhi head=temp=newnode hoga hi nahi aur agar hoga hi nahi toh else condition temp kabhi 1st node ko point hi nahi karega..... please check and clear my doubt
ERROR.........
????
??/
??
Jenny Mam you have written head=0 in void function so every time when you call the function then head will always be 0 , therefore if comdition would be follow each time .?????
Mam all ur videos are very useful mam please do upload some algorithms also mam
Already uploaded pls check my playlists
Thank You Mam
Mam there is a mistake....@10:00...you can make head as Null in create fxn....bcz every time u call create it will intialize head as Null and if(Head==0) block will execute.... So it's wrong...
Best teacher in the world 🌍🌍🌍🌍🎉🎉
Doubly_node temp = head;
public void reverselist() {
while(temp.next != null) {
temp = temp.next;
}
while(temp != null) { //if you write (temp != head) you will have the first node not printed because you will have you loop terminated when it comes to head node
System.out.println(temp.str);
temp= temp.prev;
}
}
just traverse till the end and then traverse back to head while printing all the elements in the loop (i have taken data as string so it has temp.str )
Mam shayad display function wrong hai.... Print nai hora hai
is type casting a void pointer is required or we just writing it for redability
mam great👌 but algo java mn likhy plzzz 💕