UGC NET CSE | June 2005 | Part 2 | Question: 21

Question

What is the time required to insert an element in a stack with linked implementation?

• A. $O \left(\log_{2}n \right)$
• B. $O \left(n \right)$
• C. $O \left(n \log_{2}n \right)$
• D. $O \left(1 \right)$

Answer 1

Ans: D) O(1)

Stack is the data structure with LIFO(Last In First Out) property.

In Linked-List based Implementation of stack.

• push/ insert operation = create a data node and insert it at the head of the linked list and update the pointer.
• pop/ remove operation = delete the node from the head of the list and update the "head" pointer.

Both operation can be done in O(1) operation.