The Answer given is A)
I think the naswer should be B) as we have both the prev pointer and the next pointer available , it will take constant time to update the adjacent nodes pointers and delete the given node .?
So does deletion include search time as well ?
I thought that the position of the node is already known and we have to only perform deletion.
So if this question comes in exam what do we consider ?
http://stackoverflow.com/questions/1895769/time-complexity-of-node-deletion-in-singly-and-doubly-linked-lists
For deletion=search time+link modification
When deleted node address is given then in CDLL we can perform deletion in O(1) time.
In SLL eventhough deleted node address given it takes O(n) time.
In the given question address is not specified so TC=O(n) otherwise it is O(1) only in CDLL but not DLL.
IN DLL also reaching last node it takes O(n) time in CLL with help of prev pointer at first node we can reach last in O(1)
If the pointer to the node to be deleted is given then worst case time complexity would be O(1). But since it is not given, we would have only pointer to the head. So before deleting we would have to search by traversing the LL. In worst case it might take O(n) and deleting would take only O(1).
Thus O(n).
5502 Points
4266 Points
3972 Points
3046 Points
2646 Points
2328 Points
2270 Points
2134 Points
1926 Points
1752 Points
Gatecse