Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
specified item belongs to the first node. If yes, then the pointer to the second node is temporarily assigned the pointer variable p, the memory space occupied by the first node is freed and the location of the second node is assigned to head. Thus, the previous second node becomes the first node of the new list. If the item to be deleted is not the first one, then we use the find function to locate the position of 'key node' containing the item to be deleted. The pointers are interchanged with the help of a temporary pointer variable making the pointer in the preceding node to point to the node following the key node. The memory space of key node that has been deleted if freed. The figure below shows the relative position of the key node. key node n1 n1->next n1->next->next The execution of the following code deletes the key node. p = n1->next->next; free (n1->next); n1->next = p; n1->next key node n1

specified item belongs to the first node. If yes, then the pointer to the second node is temporarily assigned the pointer variable p, the memory space occupied by the first node is freed and the location of the second node is assigned to head. Thus, the previous second node becomes the first node of the new list. If the item to be deleted is not the first one, then we use the find function to locate the position of 'key node' containing the item to be deleted. The pointers are interchanged with the help of a temporary pointer variable making the pointer in the preceding node to point to the node following the key node. The memory space of key node that has been deleted if freed. The figure below shows the relative position of the key node. key node n1 n1->next n1->next->next The execution of the following code deletes the key node. p = n1->next->next; free (n1->next); n1->next = p; n1->next key node n1

Database System Concepts
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
icon
Related questions
Question
100%

Do in c

A function to delete a specified node is given in Fig.13.9. The function first checks whether the specified item belongs to the first node. If yes, then the pointer to the second node is temporarily assigned the pointer variable p, the memory space occupied by the first node is freed and the location of the second node is assigned to head. Thus, the previous second node becomes the first node of the new list. If the item to be deleted is not the first one, then we use the find function to locate the position of 'key node' containing the item to be deleted. The pointers are interchanged with the help of a temporary pointer variable making the pointer in the preceding node to point to the node following the key node. The memory space of key node that has been deleted if freed. The figure below shows the relative position of the key node. key node n1 n1->next n1->next->next The execution of the following code deletes the key node. p = n1->next->next; free (n1->next); n1->next = p; n1->next key node n1
Transcribed Image Text:A function to delete a specified node is given in Fig.13.9. The function first checks whether the specified item belongs to the first node. If yes, then the pointer to the second node is temporarily assigned the pointer variable p, the memory space occupied by the first node is freed and the location of the second node is assigned to head. Thus, the previous second node becomes the first node of the new list. If the item to be deleted is not the first one, then we use the find function to locate the position of 'key node' containing the item to be deleted. The pointers are interchanged with the help of a temporary pointer variable making the pointer in the preceding node to point to the node following the key node. The memory space of key node that has been deleted if freed. The figure below shows the relative position of the key node. key node n1 n1->next n1->next->next The execution of the following code deletes the key node. p = n1->next->next; free (n1->next); n1->next = p; n1->next key node n1
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS