Applications of Stack:, Time Complexity of Stack...................

 

Applications of Stack:

The stack data structure has numerous applications, some of them are as follows:

1. It is used in Infix to Postfix or Infix to Prefix conversion.
2. It is used in Balancing symbols.
3. Forward and Backward feature of the Web browser.
4. Undo-Redo feature.
5. Used in algorithms like Tower of Hanoi.
6. Used in Backtracking
7. For String reversal
8. For memory management

Time Complexity of Stack

The Time Complexity of different operations of the stack is as follows:

Push Operation:

• Best Case: O(1)
• Average Case: O(1)
• Worst Case: O(N), where N is the number of items in the stack
• Space Complexity: O(1)

Pop Operation:

• Best Case: O(1)
• Average Case: O(1)
• Worst Case: O(1)
• Space Complexity: O(1)

Peek Operation:

• Best Case: O(1)
• Average Case: O(1)
• Worst Case: O(1)
• Space Complexity: O(1)

isFull operation:

• Best Case: O(1)
• Average Case: O(1)
• Worst Case: O(1)
• Space Complexity: O(1)

isEmpty operation:

• Best Case: O(1)
• Average Case: O(1)
• Worst Case: O(1)
• Space Complexity: O(1)