Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of the push and pop operations of the stack implemented using linked list (Assuming stack is implemented efficiently)?
(A) O(1) for insertion and O(n) for deletion
(B) O(1) for insertion and O(1) for deletion
(C) O(n) for insertion and O(1) for deletion
(D) O(n) for insertion and O(n) for deletion
Explanation: Stack can be implemented using link list having O(1) bounds for both insertion as well as deletion by inserting and deleting the element from the beginning of the list.
Quiz of this Question
Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.