Vidyalelo
Data Structure · Q81

Introduction to Data Structures

Programming · Data Structure · question 81

Q81

Consider the following operation performed on a stack of size 5. Push(1); Pop(); Push(2); Push(3); Pop(); Push(4); Pop(); Pop(); Push(5); After the completion of all operation, the number of elements present in stack is?

A.
1
Answer
B.
2
C.
3
D.
4

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board