Push Operation on Stack in DSA C - Cheat Sheet & Quick Revision

Recall & Review

beginner

What does the push operation do in a stack?

It adds a new element to the top of the stack, increasing its size by one.

beginner

In a stack, what happens if you try to push an element when the stack is full?

This situation is called stack overflow, and the push operation cannot add the new element.

beginner

What is the time complexity of the push operation on a stack?

The push operation runs in O(1) time because it only adds an element at the top without traversing the stack.

beginner

Show the state of the stack after pushing elements 5, then 10, then 15.

Stack top -> 15 -> 10 -> 5 -> null

beginner

Why is the stack called LIFO?

Because the last element pushed onto the stack is the first one to be removed, following Last In First Out order.

What does the push operation do in a stack?

A Checks if the stack is empty

B Removes an element from the bottom

C Adds an element to the top

D Clears all elements

Push adds a new element to the top of the stack.

What is stack overflow?

A Stack has only one element

B Trying to pop when stack is empty

C Stack is empty

D Trying to push when stack is full

Stack overflow happens when pushing to a full stack.

What is the time complexity of push operation?

A O(1)

B O(log n)

C O(n^2)

D O(n)

Push runs in constant time O(1).

If stack is empty, what is the top after pushing 7?

A null

B 7

C 0

D Undefined

After pushing 7, top points to 7.

Which order does stack follow?

A LIFO

B FIFO

C Random

D Sorted

Stack follows Last In First Out (LIFO) order.

Explain the push operation on a stack and what happens when the stack is full.

Think about adding an item on top and what limits the stack size.

Describe how the stack looks after pushing elements 3, 6, and 9 in that order.

Visualize stacking plates one on top of another.