#include<stdio.h>
#include<stdlib.h>
int top=-1,size,ans;
int arr[25];
int main(){
int (isFull()){
    if(top==size-1)
       return 1;
     else
       return 0;
}
}
int isEmpty(){
    if(top=-1)
       return 1;
    else
      return 0;
        
    }
int push(){
    int num;
    if(top==-1)
    {
        
       printf("stack is  full\n");
    }
     else{
         
      arr[++top]=num;
}
void pop(){
    if(isEmpty())
       printf("stack is empty");
     else
       top--;
       
}
int peek(){
    int ans;
    ans=peek();
    if(top!=size-1)
       peek();
    
}
void traverse(){
    for(i=0;i<=top;i++)
}
return 0;
}