Stack

#include <stdio.h>
#include <stdlib.h>

#define CAPACITY 1000
typedef struct node
{
    int data;
    struct node *next;
    struct node *prev;
} node ;
node*top=NULL,*tail;

int size = 0;

void push(int element)

{
    node *N = (node *) malloc(sizeof(node));
    N->data = element;

    N->next =NULL;
    N->prev =NULL;

    if(top==NULL)
    {
        top=N;
        tail=N;
    }
    else
    {
        top->next=N;
        N->prev=top;
        top=N;
        ++size;

    }
}
int pop()
{
    int data=0;
    node*temp;
    temp=top;
    data=top->data;
    top=top->prev;
    free(temp);
    size--;
    return data;
}


int main()
{

    int t,data,i;
    int m,l,x;

    printf("TOTAL INPUT :");
    scanf("%d",&t);
    for(i=0; i<t; i++)
    {
        scanf("%d",&data);
        push(data);
    }

    printf("\nOutput:\n");
    for(l=0; l<t; l++)
    {
        x=pop();
        printf("%d\n",x);
    }


}