Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Data Structures
Stacks
Question
Easy
What is the time complexity of push and pop operations in a stack?
A
O(n) each
B
O(1) each
C
O(log n) each
D
O(n) push, O(1) pop
Show Answer
← Back to Stacks questions
What is the time complexity of push and pop operations in a stack? | Stacks MCQ | TomoLink | TomoLink
