Assume that the node of a linked list is the usual info-link form with the info

Question

Assume that the node of a linked list is the usual info-link form with the info of type int. (list and ptr are pointers of type nodeType.) The following code creates a linked list.
ptr = new nodeType;
ptr-> info = 16;
list = new nodeType;
list -> info = 25;
list -> link = ptr;
ptr = new nodeType;
ptr -> info = 12;
ptr -> link = NULL;
list -> link -> link = pointer;

Use the linked list created by this code to answer. Declare additional pointers if you need them.
1. Write a C++ code that creates and inserts a node with info 58 before the node with info 25. Does this require you to change the value of the pointer that was pointing to the first node of the linked list?
2. Write a C++ code that deletes the node with info 25. Does this require you to change the value of the pointer that was pointing to the first node of the liked list?

Explanation / Answer

a)node with info=16 points to he first node of the linked list

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

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