C++ problem please add explain thanks Consider the following structure struct No

Question

C++ problem please add explain thanks

Consider the following structure struct Node Node "prev int key; Node next; hi 10 12 Consider a pointer named head that points to the first node in the linked list, a pointer named tail that points to the last node, a pointer named temp that points to the node with the value 10 and an extra node named newnode with a value of 15 ter executing the tollowing tenp-onext newnade nennode-next tenp-next; nemnode->prew-tenp; tenpnextprev- newnade what will be the output if we print the linked list from tail to head? Select one. Segmentaton fa O b. 37 15 10 5 12 O c none of these d 37 10 15 5 12 O O e. Infinite loop ·12 5 15 10 73 Check

Explanation / Answer

Answer is f = 12 5 15 10 7 3

Here as per given information temp points to 10 and newnode is a new node with value 15.
Now

temp=10
newnode=15
Which means here with the present linked list structure given
temp->next referring to node having value 5.

with this temp-> next is referring new node now, which is 15 ( node with 10 pointig to newnode having value 15 rather than to node 5)

With this we are pointing node 15 -> next to the node 5. So this means we placed node 15 in between 10 and 5 by setting temp-> newnode(15) and newnode->next=temp_next(5).

In this temp->next->prev means node 5 -> prev is pointing to newnode which is 15.

Finally what we have done is we set the 10->next points to 15 and 15->next points to 5 and 5 -> prev to 15. This is perfect insertion operation in linked list. So it doesn't poses any problem. so now the linked list node sequence will be 3 7 10 15 5 12

Because we are printing this list from tail to head
we will get list as 12 5 15 10 7 3

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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