Stack

The stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out).

Mainly the following three basic operations are performed in the stack:

• Push: Adds an item in the stack. If the stack is full, then it is said to be an Overflow condition.

• Pop: Removes an item from the stack. The items are popped in the reversed order in which they are pushed. If the stack is empty, then it is said to be an Underflow condition.

• Peek or Top: Returns top element of stack.

• isEmpty: Returns true if stack is empty, else false.

Python stack code:

# Function to create a stack. It initializes size of stack as 0 
def createStack():
    stack = []
    return stack


# Stack is empty when stack size is 0 
def isEmpty(stack):
    return len(stack) == 0


# Function to add an item to stack. It increases size by 1 
def push(stack, item):
    stack.append(item)
    print(item + " pushed to stack ")


# Function to remove an item from stack. It decreases size by 1 
def pop(stack):
    if (isEmpty(stack)):
        return str(-maxsize - 1)  # return minus infinite 

    return stack.pop()


# Function to return the top from stack without removing it 
def peek(stack):
    if (isEmpty(stack)):
        return str(-maxsize - 1)  # return minus infinite 
    return stack[len(stack) - 1] 

c++ stack is in <stack>:

• empty

• size

• back

• push_back

• pop_back