Realization Stack with Using LinkedList

gistfile1.cpp

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

typedef struct _Stack
{
	int data;
	struct _Stack* pNext;
}Stack;

typedef Stack* Stack_Top;

bool   push(Stack data);
Stack  pop();
bool   isFull();
bool   isEmpty();
void   PrintStack();

Stack_Top	top = NULL;
bool        bFull = false;

void main()
{

	Stack       s;

	s.data =1,push(s);
	s.data =2,push(s);
	s.data =3,push(s);
	s.data =4,push(s);

	PrintStack();

	pop(),pop();
	PrintStack();
}

bool push(Stack data)
{
	Stack* node = (Stack*)malloc(sizeof(Stack));

	if ( node == NULL)
	{
		printf("Stack is full\n");
		bFull = true;
		return !bFull;
	}

	node->data	=	data.data;
	node->pNext	=	NULL;

	if ( top == NULL)
	{
		top	=	node;
	}
	else 
	{
		node->pNext	=	top;
		top		=	node;
	}

	return true;
}

Stack pop()
{
	Stack  temp		 = *top;
	Stack* temp_next = top->pNext;

	free(top);
	top	=	temp_next;

	bFull = false;
	return temp;
};

void PrintStack()
{
	Stack_Top temp = (Stack_Top)malloc(sizeof(Stack));
	temp = top;

	while ( temp != NULL)
	{
		printf("%2d",temp->data);
		temp = temp->pNext;
	}
	printf("\n");
}
bool isFull()
{
	return bFull;
}
bool isEmpty()
{
	return top == NULL ? true:false;
}