Which of the following operations on a stack has a time complexity of O(1)?
Practice Questions
Q1
Which of the following operations on a stack has a time complexity of O(1)?
Push
Pop
Peek
All of the above
Questions & Step-by-Step Solutions
Which of the following operations on a stack has a time complexity of O(1)?
Step 1: Understand what a stack is. A stack is a data structure that follows the Last In, First Out (LIFO) principle.
Step 2: Identify the main operations of a stack: Push (adding an item), Pop (removing the top item), and Peek (viewing the top item without removing it).
Step 3: Learn about time complexity. Time complexity is a way to describe how the time to complete an operation grows as the size of the data increases.
Step 4: Recognize that O(1) means constant time. This means the operation takes the same amount of time regardless of how many items are in the stack.
Step 5: Analyze each operation: Push adds an item to the top, Pop removes the top item, and Peek shows the top item. All these operations do not depend on the number of items in the stack.
Step 6: Conclude that since all three operations (Push, Pop, and Peek) take the same amount of time no matter how many items are in the stack, they all have a time complexity of O(1).
