#include<stdio.h>
#include<alloc.h>
#include<conio.h>
struct node
{
  int data;
  struct node* next;
};
typedef struct node node;
node* curr_ptr=NULL;
node* head=NULL;
int count=0;
#define max 5
main()
{
  int stack_size;
  int choice;
  int ele;
  clrscr();
  while(1)
  {
    printf("\n\n\t1.Push\n\t2.Pop\n\t3.Display\n\t4.Exit\n");
    printf("\n\tEnter Your Choice: ");
    scanf("%d",&choice);
    switch(choice)
    {
      case 1: if(count==max)
	     {
	       printf("\n\n\t\tSTACK OVERFLOW!!!");
	       clrscr();
	     }
	     else
	     {
	       printf("\n\n\t\tEnter The Element To Push: ");
	       scanf("%d",&ele);
	       Push(ele);
	     }
	     break;
      case 2: if(count==0)
	     {
	       printf("\n\n\t\tSTACK UNDERFLOW!!!");
	     }
	      else
	      Pop();
	      break;
      case 3: Display();
	      break;
      case 4: exit();
	      break;
     }
   }
}
Push(int info)
{
  node* new_node;
  new_node=(node*)malloc(sizeof(node));
  new_node->data=info;
  new_node->next=NULL;
  if(head==0)
  {
    head=new_node;
    curr_ptr=head;
    count++;
  }
  else
  {
    curr_ptr->next=new_node;
    curr_ptr=curr_ptr->next;
    count++;
  }
  return;
}
Pop()
{
  node* pre_node, *temp1;
  node* temp=head;
  if(count==1)
  {
    head=0;
    free(temp);
    printf("\n\n\t\tNode is Deleted");
    return;
  }
  else
  {
    while(temp->next!=0)
    {
     pre_node=temp;
     temp=temp->next;
    }
    printf("%d",pre_node->data);
    temp1=pre_node->next;
    pre_node->next=NULL;
    free(temp1);
  }
  return;
}
Display()
{
  node* temp=head;
  if(head==NULL)
  {
  printf("\n\tList Empty!!!");
   return;
  }
  while(temp!=NULL)
  {
    printf("%d\t",temp->data);
    temp=temp->next;
  }
  return;
}

the above has bugs! for example, the count is not 
decremented in Pop function...

I rewrote the Push and Pop code as follows:

node *cur = NULL;
node *head = NULL;

void Push(int info)
{
    node *new;

    new = (node *)malloc(sizeof(node));
    new->data = info;
    new->next = NULL;
    if (head == NULL)
        head = new;
    else
        cur->next = new;
    cur = new;
    count++;
}

void Pop(void)
{
    node *pre = NULL;
    node *temp = head;

    while (temp != cur) {
        pre = temp;
        temp = temp->next;
    }

    printf("\n\tNode (%d) is deleted.", cur->data);
    free(cur);
    count--;

    cur = pre;
    if (cur)
        cur->next = NULL;
    else
        head = NULL;
}

And much better and simpler implementation should be like 
this:

void Push(int info)
{
    node *temp;

    temp = (node *)malloc(sizeof(node));
    temp->data = info;
    temp->next = head;
    head = temp;
    count++;
}

void Pop(void)
{
    node *temp;

    temp = head;
    head = head->next;
    free(temp);
    count--;
}