C++ programming, add explain, please. Write a C++function to delete a node to th

Question

C++ programming, add explain, please.

Write a C++function to delete a node to the beginning of a linked list. Your function takes one argument- the head of the linked list with at least one node in it. Your function should modify the head of the linked list to point to the new head node. If the list is empty after deleting, head points to null Example Initial List: 4->2->3 List After Function Call: 2->3 void Delete(Node& head); The linked list structure struct Node int keys node *next; bi For example Test Result // head points to linked 1ist 5->3->2->4 After calling your function, the list is 3->2->4 // Delete(head); // head points to linked list 3->2->4 Answer: (penalty regime: 05.10.15, %) 1 void Add Node& head, int key) Node *temp = new Node; temp->val key; temp->next = head; head temp ; 4 6 7

Explanation / Answer

void Delete(Node*& head){

if(head != null) //there is atleast one node in linked list

head = head->next; //updating head to next node

}

The head pointer stores the strting address of the linked list. head->next stores the value of the next node of the linked list. So if we update the head value to next address the head node points to the next node and so the starting node is not accessible and the list start form updated value of head i.e.., second node

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.