GO Classes DA Test Series | Data Structures and Algorithms | Topic Wise Test 1 | Question: 4

Answer 1

Comments

IN this explnation it is written that 5000-> prev = 3000 , how can be it is 3000?? why not 4000

---

given head.next.next.prev = head (1) break it down as-

head - 3000

head.next - 4000

head.next.next - 5000 Replace this into (1) we get

5000.prev=head

we know that head=3000

hence, 5000.prev=3000

 

---

@Protyusha_Ghosh

bcz code says (head.next.next.prev = head) 

it means

left hand side = right hand side

again it means

• Python first evaluates the right-hand side (RHS)

• Then it assigns that value or reference to the left-hand side (LHS)

• Evaluate RHS → head node with value 5

• Assign to LHS → head.next.next.prev (9.prev → 5)

• head.next.next.prev, it now refers to 5.

                                       correct me if i am wrong  

Answer 2

If Plotted Address correctly, This Problem is Easy to solve.

Answer 3

sol:

Answer 4

Explanation:
    Initially, head points to the first node 1.
    The first statement updates head to point to head.next.next.next.prev, which is 5.
    The second statement head.next.next.prev = head that means 9->prev = head. 

print(head.next.next.prev.next.value) = 7.

Answer 5