Friday, September 16, 2011

Delete a node from singly linked list when only pointer to node to be deleted is given in O(1).

Say node to be deleted is toDelete.
copy ( toDelete->next->element, toDelete->element);
remove( toDelete->next );

* We are not really deleting the node but we are achieving what we want to do ;)
* Problem in this approach when toDelete is the last node, Solution is circular linked list or a temporary tail node

No comments:

Post a Comment