linked list node deletion query

[finite vine]

What does node*next=temp->next->next;

[versed thistle]

When your question is answered use !solved to mark the question as resolved.

Remember to ask specific questions, provide necessary details, and reduce your question to its simplest form. For more information use !howto ask.

[finite vine]

https://www.google.com/amp/s/www.geeksforgeeks.org/delete-a-linked-list-node-at-a-given-position/amp/

Here is link

Also a photo

Won't there be collision of next

Won't the compiler get confused between next (data member) of class and next node

[lethal laurel]

do you know how pointers work?

[finite vine]

I understood the concept of pointers

But i want to know if there would be collision or no

[finite vine]

Thissss

[finite vine]

What is answer to this q i want to know

[lethal laurel]

this line creates a pointer called next, equal to temp->next->next

[finite vine]

?

[finite vine]

Well I understand that

[lethal laurel]

it will always chose the data member called next

[finite vine]

So in place of next i can create some other node too as well right?

Just different name for the variable instead of next

[lethal laurel]

yes

[versed thistle]

This question thread is being automatically closed. If your question is not answered feel free to bump the post or re-ask. Take a look at !howto ask for tips on improving your question.