Question

qn. The pop operation in a linked stack will be equivalent to_______singly linked list.


Deletion from the end

Deletion from the front.

Deleting an intermediate node

None of these

Answer 1

Answer:Deleting an intermediate node(may be)

Explanation:

Whenever we delete a node in a single linked list, the link part of the previous node (that stores the address of the node being deleted) needs to be altered. And since we do not have the address of the starting node, we cannot get the address of the previous node and hence cannot change its link part.

However there's a simple hack. What we can do is copy the data of the next node into the node being deleted and then delete the next nod