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

Question

3. Assume that the node of a linked list is in the usual info-link form with the info of type int. The following data, as described in parts (a) to (d), is to be inserted into an initially linked list: 72, 43, 8, 12. Suppose that head is a pointer of type nodeType. After the linked list is created, head should point to the first node of the list. Declare additional variables as you need them. Write the C++ code to create the linked list. After the linked list is created, write a code to print the list. What is the output of your code? a. Insert 72 into an empty linked list. b. Insert 43 before 72. c. Insert 8 at the end of the list. d. Insert 12 after 43.

Explanation / Answer

#include #include typedef struct node{ int val; struct node *next; } main() { int n,i,input; node head,* temp; temp=&head; scanf("No. of nodes: %d", &n); scanf("%d",&input); head.val=input; for(i=1;inext=(node *)malloc(sizeof(node)); temp=temp->next;} temp->val=input; temp->next=NULL; } temp=&head; for(i=0;ival); temp=temp->next; } }

Related Questions

Navigate

• Browse (All)
• Browse 3
• Subjects

---

---

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