Sir we are eagerly waiting for your videos. Please do upload it regularly. Your teaching style is excellent. Highly recommended 🔥🔥.... Thank you so much Neso Academy ❤️
can anyone please tell me why this code is not working if I interchange the position of condition like this : while(temp->link->datalink!=NULL) if I write the code like in the video then the code is working well Please reply Neso Academy and thanksssss a lot for this type of quality in your course
if(head==NULL || numerodato){ //in case i add the node at the beginning temp->link=head; head=temp; return head; }
while(ptr!=NULL){ if(ptr->link==NULL){ //in case i add the node at the end if(numero>ptr->dato){ ptr->link=temp; temp->link=NULL; break; } } if(numero>ptr->dato&&numerolink->dato){ temp->link=ptr->link; ptr->link=temp; } else{ ptr=ptr->link; } }
I don't think I could have understood data structure to this level if I didn't find your videos. Thank you very much sir
Sir we are eagerly waiting for your videos. Please do upload it regularly. Your teaching style is excellent. Highly recommended 🔥🔥.... Thank you so much Neso Academy ❤️
Thank you sir.. Your video helps me a lot..Love from Bangladesh.❤️
Thanks for the code brother it really helped me!!
Much love from Egypt
Very helpful video sir
Please upload daily video
this video is the most useful explaination i had ever seen thanks for your effort💙💙💙💙
sir i'm really addictive to ur voice. U hv such a peaceful tone.
Only legend can teach Data structure and algorithms 💯
❤❤❤
Im really thankfull to you I understood what does data strcuture mean with you
Sir , When Will NESO Start C++ Course .........
The best ever channel I found in youtube ....
Once again thanks to all my NESO Brothers !!! 😁
It is STARTED.
Please add tree and graph contents.. It will be really helpful for students💯
You are doing god work sir.
I love Neso Academy ❤
the illustrations are very useful
Thank you for this wonderful tutorial.
how to sort a linked list? can you explain please?
Sir is this data structure playlist is completed ? If not then how many videos are left?
It's not completed :(
@@manshisinha7953 yeah :(
Too late now! :(
@@HardikArekar05 i think atleast 100 more videos are yet to come
Is speed se agar videos aaayenge toh atleast 2021 end tak data structures complete ho paayega
Thank you 🙏
Sir aap regular basic pa more video bhaj diya karo es course ki please
Your videos are great. Please upload ELECTRICAL MACHINES videos..
Sir please upload regularly
We are eagerly waiting for next video
Sir plzz upload data structure video fast .....🙏🙏🙏
Thank you sir 🫡
can anyone please tell me
why this code is not working if I interchange the position of condition like this : while(temp->link->datalink!=NULL)
if I write the code like in the video then the code is working well
Please reply Neso Academy
and thanksssss a lot for this type of quality in your course
Sir please upload lectures on c++🙏🙏🙏🙏🙏🙏🙏
I started at the bottom, and one year later I'm at the bottom of the playlist :D!
you should've included the context in your sentence, y'know i got confused at first.
@@harshalkumar4538 ok
This was so helpful !! Thank you
Do you have a data structure abd algorithms course in your channel ? With java ?
and*
head? where can I find that?
Please complete this playlist😭😭😭
I am trying to do it in a recursive way please can you tell me if it is true or not??
sNode* recr_insert_SSL_sorted(sNode* Head, int value)
{
if (Head->intval > value )
{
sNode* newNode;
newNode = new sNode;
newNode->intval = value;
newNode->next = Head->next;
Head->next = newNode;
return newNode;
}
Head->next = recr_insert_SSL_sorted(Head->next, value);
}
sir please upload the further videos we are waiting.
Good morning sir I want merge sort algorithm plzzzzzz
what is the fault in this?
node * insert(node *head,int data)
{
node *ptr,*ptr2,*ptr3;
ptr3 = (node *)malloc(sizeof(node));
ptr3->data = data;
ptr = head;
while(ptr->data < data)
{
ptr = ptr->next;
}
ptr3->next = ptr;
ptr2->next = ptr3;
return head;
}
❤️❤️❤️
Can we get this slides pdf plzzz
This is what i did
struct node *anadir(struct node *head,int numero){
struct node *temp=malloc(sizeof(struct node));
struct node *ptr=head;
temp->dato=numero;
temp->link=NULL;
if(head==NULL || numerodato){ //in case i add the node at the beginning
temp->link=head;
head=temp;
return head;
}
while(ptr!=NULL){
if(ptr->link==NULL){ //in case i add the node at the end
if(numero>ptr->dato){
ptr->link=temp;
temp->link=NULL;
break;
}
}
if(numero>ptr->dato&&numerolink->dato){
temp->link=ptr->link;
ptr->link=temp;
}
else{
ptr=ptr->link;
}
}
return head;
}
please add treee graph video. we cant afford.
Was❤
So slow... cover fast