Min Stack[Easy]

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.

• getMin() -- Retrieve the minimum element in the stack.

class MinStack {
    
    class Node {
        int val;
        Node next;
        int minVal;
        public Node(int val,int minVal,Node next) {
            this.val = val;
            this.minVal =minVal;
            this.next = next;
            
        } 
        
    }
    
    Node head;
    int minVal = 0;
    int top = 0;
    
    public void push(int x) {
        
        if(head==null) {
            head = new Node(x,x,null);
            top =x;
            minVal=x;
        }
        
        else{
        
        if(x<minVal) minVal  = x;
            
        Node temp = new Node(x,minVal,head);    
            head = temp;
            top = x;
        }
    }

    public void pop() {
        if(head != null) {
            head = head.next;
            if(head  != null ) {
            minVal = head.minVal;
            top=head.val;
        }
        }
        
    }

    public int top() {
       return top;
        
    }

    public int getMin() {
        return minVal;
        
    }
}