GATE 1993 Question - Marks 5
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, d1,d2,..........,dn in the order without using the header.
Total 2 Questions