What is wrong with the following definition of headInsert?
Struct Node
{
Int item;
Node* link;
};
Typedef Node* NodePtr;
Void headInsertNodePtr& head, int data)
{
NodePtr tmp = new Node;
Tmp-item = data;
Head-next = tmp;
Tmp-next = head-next;
}
NodePtr head;
HeadInserthead, 4);
A) head-next is pointing to NULL
B) if there were any nodes following head they are now lost.
C) nothing is wrong.
D) tmp should be declared to be a Node not a NodePtr

Question

What is wrong with the following definition of headInsert?
Struct Node
{
Int item;
Node* link;
};
Typedef Node* NodePtr;
Void headInsertNodePtr& head, int data)
{
NodePtr tmp = new Node;
Tmp->item = data;
Head->next = tmp;
Tmp->next = head->next;
}
NodePtr head;
HeadInserthead, 4);
A) head->next is pointing to NULL
B) if there were any nodes following head they are now lost.
C) nothing is wrong.
D) tmp should be declared to be a Node not a NodePtr

Quizplus · Accepted Answer

The headInsert function is supposed to insert a new node at the beginning of the linked list, but the implementation is incorrect. Setting `head->next = tmp;` effectively deletes any nodes that were previously linked after `head`, because `head->next` is not preserved before the assignment. Therefore, option B is the correct choice.

What Is Wrong with the Following Definition of HeadInsert