linked list conceptual

Question

Comments

Option a)

---

Yes it is correct. Can u please explain how ? Because we directly have a end pointer given, just simply make the last before node as tail and delete the last node. So why do we have to traverse the entire list?

---

If you se we have a singly linked list given pointer to the last node, in order to delete the last node we have to free the last node(constant time bcoz pointer is given), in the same time we have to make next pointer of second last element point to NULL. So Do we have address of second last node??? No..(It is Singly linked list)

That's why we have to traverse till second last node and point its next pointer to NULL and free the last node.

If doubly linked,it can be done in constant time, in this case we have address of second last element too with the help of last node

Hope it helps.

---

Yes , this helped me. Thank you