In a stack, which operation is performed in constant time?

In a stack, which operation is performed in constant time?

Step 1: Understand what a stack is. A stack is a data structure that follows the Last In, First Out (LIFO) principle.
Step 2: Learn about the main operations of a stack: Push, Pop, and Peek.
Step 3: Push means adding an item to the top of the stack.
Step 4: Pop means removing the item from the top of the stack.
Step 5: Peek means looking at the item on the top of the stack without removing it.
Step 6: Realize that all these operations (Push, Pop, Peek) can be done without needing to look at other items in the stack.
Step 7: Since these operations do not depend on the size of the stack, they are performed in constant time, which is denoted as O(1).

No concepts available.