Why is a temporary node important while deleting a head node in a singly linked list?

Answer 1

You have to copy adress of old head (for delete) set old second node like new head node and remove old head node (using stored reference)... There isnt trace of temporary node in execution... What are you mean?

Answer 2

thanks all, i have clearly understand!!!.

Answer 3

thanks, but how do you set the old second node as the head node?

Answer 4

At example:

struct Node{
Node* next;
.......
};

class LinkedList{
private:
Node* head;
......
public:
void popBack(){
if(this->head){
if(this->head->next){
Node* oldHead= head;
this->head= oldHead->next;
......
}else{
this->head= NULL;
}
}
}
};

Answer 5

Futhermore what that「ＨＡＰＰＹ ＴＯ ＨＥＬＰ」sayed i want precise that you have need to store reference to old node and not copy it

Answer 6

You are welcome 👍👍👍