Linked list

Question

If the head of a Linked List is pointing to $k$ th element, then how will you get the elements before $k$ th element?

Comments

In case of single linked list we can't get that elements..

---

The answer is given that Use memory efficient Linked lists [XOR Linked Lists]

---

U can read about this here:https://www.geeksforgeeks.org/xor-linked-list-a-memory-efficient-doubly-linked-list-set-1/

---

Yes, I will try to read it, this concept is important for GATE?

---

As of now, i think no such questions have been asked..But still u can read about it.

---

The traversal of xor list is possible if we know address of the previous or later node. How is xor list sufficient to get the previous nodes till k.Xor list can traverse in both directions but  here how can we traverse backward if we don't know the previous address?