Here in deletion at specified position we didnt kept NULL for data element 30. it is still having link to the tail. i think we need to code as : new=temp;//i have just taken new as another variable temp=temp->next; new->next=temp->next; temp->next=NULL;
Sir, I have doubt regarding to deletion at specific postion..after the forloop you wrote temp->next=temp->next->next why don't we write it as temp->next =tail...
We can't write temp->next=tail because we are writing this code for a general linked list. So for example there may be a condition where we have 10 nodes and we want to delete 3rd node, so there temp->next=tail fails because tail is the last node but temp->next=temp->next->next will work in all conditions.
sir big fan sir but the deletion code in the specified position, suppose the position is 3(instead of 2 in the example) and the loop iterates twice, could you elaborate on how that will work? will 2 nodes get deleted then instead of the reqd. one node, please reply sir
pls make more videos on Hash tables, including strategies for avoiding and resolving collisions, Binary search trees, Common operations on binary search trees such as select min, max, insert, delete, iterate over tree, Graphs and graph algorithms , Representations of graphs, Depth- and breadth-first traversals , Heaps ,Graphs and graph algorithms , Shortest-path algorithms (Dijkstra and Floyd) , Minimum spanning tree (Prim and Kruskal).
Head pointer pahele node ko point karta h maan lo head point kar raha h ek node ko jiska address 1000 h ab agar hum waha par head=head->next likhte h toh iska mtlb h ki head ab apne address part ko point karega maan lo 2000 h pahele node ke address part m toh ab head us node ko point karega jiska address 2000 h
Simply declare a temp variable and store the address of the deleted link. P=head; While(p of link not equal to head) { P=p of link; } Temp=p of link; P of link = temp of link; Free (temp);
its very easvy and too much easy explantion my final exams and your vedios too much help me thanks alot sir
Waiting for this video ,Thank you for uploading Sir
Hi harshitha
Thank you very much for your support towards our channel share our channel with your friends and keep following our channel
👍👍👍👍👍👍👍 🤘 explanation
See all video for link list and I saw your video that is amazing..
Good explanation sir👏👏👏👏
Thank u so much sir for all of your efforts!!!
You are great sir.
Thanks for this video sir😊
Here in deletion at specified position we didnt kept NULL for data element 30. it is still having link to the tail. i think we need to code as :
new=temp;//i have just taken new as another variable
temp=temp->next;
new->next=temp->next;
temp->next=NULL;
yes i thought same.Hope its the right way.
Superb Lecture but I have a doubt I mentioned it in comment already
Sir if we delete 30(pos -2) than 30 of next should be null ,is it correct sir?
" temp->next->next=NULL "
Very nice teaching
Thanksgiving the content
Sir, I have doubt regarding to deletion at specific postion..after the forloop you wrote temp->next=temp->next->next why don't we write it as temp->next =tail...
We can't write temp->next=tail because we are writing this code for a general linked list. So for example there may be a condition where we have 10 nodes and we want to delete 3rd node, so there temp->next=tail fails because tail is the last node but temp->next=temp->next->next will work in all conditions.
Nice explanation sir
you are not mentioning the how to reach the tail in any of the video, could you explain how can we consider tail
Superb explanation
Thank you soo much 🙏👏.. Sir
Super sir😊😊
sir, if we are not freeing the node i think thats much only not sufficient for deleting the node
Sir in deletion at specified position instead of using temp->next= temp->next->next can we use temp->next =tail
No
Why same doubt
I had
sir big fan sir but the deletion code in the specified position, suppose the position is 3(instead of 2 in the example) and the loop iterates twice, could you elaborate on how that will work? will 2 nodes get deleted then instead of the reqd. one node, please reply sir
In specified position still having link to the tail. I think we need to code. Pls reply sir
Thank you sir ❤️
Sir can u make a video on data structure online bits.. Please respond sir..
Thank 👉🙏💕
hi
sure
i will try to do that.
thanks for your support towards our channel.
please provide complete programs in links, so we can run the programs without any difficulty
Why we did not made the next position =null of deleted element ,as done in deletion from end
Sir deallocating memory is compulsory
Hi.yes we have to deallocate the memory using free ( ) function.
Then we need to traverse one more pointer variable upto that position?
awesome thanks sir
I think you must disconnect the link of the specified position
What about deleting all the nodes?
Sir can you explain how to free node in deletion of position!!
pls make more videos on Hash tables, including strategies for avoiding
and resolving collisions, Binary search trees, Common operations on binary search trees such as select
min, max, insert, delete, iterate over tree, Graphs and graph algorithms , Representations of graphs,
Depth- and breadth-first traversals , Heaps ,Graphs and graph algorithms , Shortest-path algorithms
(Dijkstra and Floyd) , Minimum spanning tree (Prim and Kruskal).
Sir delete at specific position ko kese free karenge vaha pe to koi value point out ho hi nahi rahi he ???????
May inflow the value of null
Sir,In specified position node 30 is not assigned to null
If you assign head to temp variable then why you write head-> next
can u please make a video of searching node in circular linked list??
You are not freeing any memory so this method is not appropriate especially in the last part the node to be deleted was still pointing to the tail
Hi
Yes we can update next and free the memory with free( ) function.
Good observation
Before tail=temp ,use free(tail).
thank u sir
Hello Sir, you delete the last element but never return the node temp? @ minutes 12-14
sir can u upload doubly circular lined list in c
Hlw sir we are not assigned tail
Thnks
thanku sir....
Sir diletion in beginning main ye head = head->next kaise huwa.. Samaj nahi aa raha
Head pointer pahele node ko point karta h maan lo head point kar raha h ek node ko jiska address 1000 h ab agar hum waha par head=head->next likhte h toh iska mtlb h ki head ab apne address part ko point karega maan lo 2000 h pahele node ke address part m toh ab head us node ko point karega jiska address 2000 h
Sir I have a problem in this. and I need instant solution .plz help me
Can you plz give as code completely from the header file sir....?
Sir please can u provide proper code of all the process !!! And thank you sir!!
Sir Apne free nahi Kiya Jo deleted node he vo
Sir instead of temp of next of next, can't we use tail?
No,if u have 7 nodes & if u want delete the 3rd element then how can we del node 3 by using tail,that's y he is using temp->next=temp->next->next
You can declare one extra variable then
Deletion at end...is wrong ..so please correct it..
Simply declare a temp variable and store the address of the deleted link.
P=head;
While(p of link not equal to head)
{
P=p of link;
}
Temp=p of link;
P of link = temp of link;
Free (temp);