What singly linked list of nodes is accessible from n after the following statem

Question

What singly linked list of nodes is accessible from n after the following statements have executed? Node n = new Node (1); n. next = new Node (2, new Node (3)) n. next = n. next. next; n = new Node (4, n); n. next. next = new Node (5); n. next = new Node (6, n. next); A. [1] rightarrow [2] rightarrow [3] rightarrow [4] rightarrow [5] rightarrow [6] B. [6] rightarrow [5] rightarrow [4] rightarrow [3] rightarrow [2] rightarrow [1] C. [4] rightarrow [6] rightarrow [1] rightarrow [5] D. [4] rightarrow [5] rightarrow [6]

Explanation / Answer

Answer is C . Lets See How

I am writing the state after each line of code

Line Number . State of List

1. n = 1 Initially
2. 1--->2--->3
3.1-->3
4.4-->1-->3
5.4-->1-->5
6.4-6-1-5

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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