I would like to know what is going on specifically in the void deleteNode class. I know there's a description, but I'm confused about how the code inside the class works. Thank you. The code: #include using namespace std; // A linked list node class Node { public: int data; Node *next; }; // Given a reference (pointer to pointer) to // the head of a list and an int inserts a // new node on the front of the list. void push(Node** head_ref, int new_data) { Node* new_node = new Node(); new_node->data = new_data; new_node->next = (*head_ref); (*head_ref) = new_node; } // Given a reference (pointer to pointer) to // the head of a list and a position, deletes // the node at the given position void deleteNode(Node **head_ref, int position) { // If linked list is empty if (*head_ref == NULL) return; // Store head node Node* temp = *head_ref; // If head needs to be removed if (position == 0) { // Change head *head_ref = temp->next; // Free old head free(temp); return; } // Find previous node of the node to be deleted for(int i = 0; temp != NULL && i < position - 1; i++) temp = temp->next; // If position is more than number of nodes if (temp == NULL || temp->next == NULL) return; // Node temp->next is the node to be deleted // Store pointer to the next of node to be deleted Node *next = temp->next->next; // Unlink the node from linked list free(temp->next); // Free memory // Unlink the deleted node from list temp->next = next; } // This function prints contents of linked // list starting from the given node void printList( Node *node) { while (node != NULL) { cout << node->data << " "; node = node->next; } } // Driver code int main() { // Start with the empty list Node* head = NULL; push(&head, 7); push(&head, 1); push(&head, 3); push(&head, 2); push(&head, 8); cout << "Created Linked List: "; printList(head); deleteNode(&head, 4); cout << "\nLinked List after Deletion at position 4: "; printList(head); return 0; }

I would like to know what is going on specifically in the void deleteNode class. I know there's a description, but I'm confused about how the code inside the class works. Thank you. The code: #include using namespace std; // A linked list node class Node { public: int data; Node *next; }; // Given a reference (pointer to pointer) to // the head of a list and an int inserts a // new node on the front of the list. void push(Node** head_ref, int new_data) { Node* new_node = new Node(); new_node->data = new_data; new_node->next = (head_ref); (head_ref) = new_node; } // Given a reference (pointer to pointer) to // the head of a list and a position, deletes // the node at the given position void deleteNode(Node **head_ref, int position) { // If linked list is empty if (head_ref == NULL) return; // Store head node Node temp = head_ref; // If head needs to be removed if (position == 0) { // Change head head_ref = temp->next; // Free old head free(temp); return; } // Find previous node of the node to be deleted for(int i = 0; temp != NULL && i < position - 1; i++) temp = temp->next; // If position is more than number of nodes if (temp == NULL || temp->next == NULL) return; // Node temp->next is the node to be deleted // Store pointer to the next of node to be deleted Node next = temp->next->next; // Unlink the node from linked list free(temp->next); // Free memory // Unlink the deleted node from list temp->next = next; } // This function prints contents of linked // list starting from the given node void printList( Node node) { while (node != NULL) { cout << node->data << " "; node = node->next; } } // Driver code int main() { // Start with the empty list Node* head = NULL; push(&head, 7); push(&head, 1); push(&head, 3); push(&head, 2); push(&head, 8); cout << "Created Linked List: "; printList(head); deleteNode(&head, 4); cout << "\nLinked List after Deletion at position 4: "; printList(head); return 0; }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

I would like to know what is going on specifically in the void deleteNode class. I know there's a description, but I'm confused about how the code inside the class works. Thank you.

The code:

#include <iostream>

using namespace std;

// A linked list node

class Node

{

public:

int data;

Node *next;

};

// Given a reference (pointer to pointer) to

// the head of a list and an int inserts a

// new node on the front of the list.

void push(Node** head_ref, int new_data)

{

Node* new_node = new Node();

new_node->data = new_data;

new_node->next = (*head_ref);

(*head_ref) = new_node;

}

// Given a reference (pointer to pointer) to

// the head of a list and a position, deletes

// the node at the given position

void deleteNode(Node **head_ref, int position)

{

// If linked list is empty

if (*head_ref == NULL)

return;

// Store head node

Node* temp = *head_ref;

// If head needs to be removed

if (position == 0)

{

// Change head

*head_ref = temp->next;

// Free old head

free(temp);

return;

}

// Find previous node of the node to be deleted

for(int i = 0; temp != NULL && i < position - 1; i++)

temp = temp->next;

// If position is more than number of nodes

if (temp == NULL || temp->next == NULL)

return;

// Node temp->next is the node to be deleted

// Store pointer to the next of node to be deleted

Node *next = temp->next->next;

// Unlink the node from linked list

free(temp->next); // Free memory

// Unlink the deleted node from list

temp->next = next;

}

// This function prints contents of linked

// list starting from the given node

void printList( Node *node)

{

while (node != NULL)

{

cout << node->data << " ";

node = node->next;

}

// Driver code

int main()

{

// Start with the empty list

Node* head = NULL;

push(&head, 7);

push(&head, 1);

push(&head, 3);

push(&head, 2);

push(&head, 8);

cout << "Created Linked List: ";

printList(head);

deleteNode(&head, 4);

cout << "\nLinked List after Deletion at position 4: ";

printList(head);

return 0;

}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.