Question 6113 – UGC NET CS 2008-june-Paper-2
March 14, 2024Question 3709 – UGC NET CS 2015 Dec- paper-2
March 14, 2024Linked-List
|
Question 7
|
Consider a singly linked list having n nodes. The data items d1, d2, …dn are stored in these n nodes. Let X be a pointer to the j-th node (1≤j≤n) in which dj is stored. A new data item d stored in node with address Y is t be inserted. Give an algorithm to insert d into the list to obtain a list having items d1, d2, …, dj-1, dj, …, dn in the order without using the header.
|
Theory Explanation.
|
Correct Answer: A
Subscribe
Login
0 Comments