笔记出栈入栈操作

#include<stdio.h>
#include<stdlib.h>
#define  BOTTOM -1
#define  MAX 10

struct stack_data
{
    int top;
	int stack[MAX];
};

enum return_result{FULL_OK,FULL_NO,EMPTY_OK,EMPTY_NO,PUSH_OK,PUSH_NO,POP_OK,POP_NO};

typedef struct stack_data Stack;

void create_stack(Stack ** stack)
{
	*stack = (Stack *)malloc(sizeof(Stack));
	if(NULL ==*stack)
	{
		printf("malloc error!\n");
		exit(-1);
	}
}

int is_empty(Stack *stack)
{
    if(stack->top == BOTTOM)
    {
		printf("stack is empty\n");
        return EMPTY_OK;
    }
    else
    {
        return EMPTY_NO;
    }
}

int pop_stack(Stack *stack,int num)
{
    if(is_empty(stack) == EMPTY_OK)
    {
		return POP_NO;
    }
	else
	{
		return stack->stack[stack->top];
		stack->top--;
	}

}

void init_stack(Stack * stack)//
{
	stack->top = BOTTOM;
}

int push_stack(Stack * stack,int num)
{
	if(is_full(stack) == FULL_OK)
	{
		printf("stack is full\n");
		return PUSH_NO;
	}
	stack->top++;
	stack->stack[stack->top] = num;
	return PUSH_OK;
}

int is_full(Stack *stack)
{
	
	if(stack->top == MAX -1)
		return FULL_OK;
	else
		return FULL_NO;
	
}




int main()
{
	Stack *stack;
    int i,n;
	create_stack(&stack);
	init_stack(stack);
	printf("进栈");
	for(i = 0;i<15;i++)
	{
		if(push_stack(stack,i+1) == PUSH_OK)
		{
			printf("push ok %5d\n",i);
		}
	}
	printf("出栈");
	for(i = MAX;i > 0;i--)
	{
		n = pop_stack(stack);
		if(n != POP_NO)
			printf("pop ok %d :\n",n);
	}
	free(stack);
	return 0;
}