Sequence stack version 1.0

I made a sequence stack and chain stack before , Why do we say to upgrade the sequence stack , When I was writing to traverse a binary tree with a sequence stack , There's a problem , Look at the data storage in the sequence stack I wrote before

What's in it is int Element of type , But for binary trees , We need to iterate over complex data structure types

That is, the address of this node is passed into the stack , So we have to change the data type in the stack , So that you can store any data type

Don't talk much , Go straight to the code ：

seqstack1.0.h

#ifndef _SEQSTACK1_H_
#define _SEQSTACK1_H_
#define EMPTY_INDEX -1// On behalf of the stack, Li Amin has no elements 
#define MAX 100// Define stack space size 

typedef void* element_type;

// Define the header space of the stack 
typedef struct _t_seq_stack {
	element_type arr[MAX];
	int top_index;
}t_seq_stack;

// Create a stack 
t_seq_stack* create_stack();
// Judge whether the stack is empty 
int is_empty(t_seq_stack *stack);
// Destroy the stack 
void destroy_stack(t_seq_stack *stack);
// Empty stack 
void make_empty(t_seq_stack *stack);
// Out of the stack 
void pop_stack(t_seq_stack *stack);
// Push 
void push_stack(t_seq_stack *stack,element_type value);
// Get to the top of the stack 
element_type top_stack(t_seq_stack *stack);

#endif

seqstack1.0.c

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "seqstack1.0.h"

// Create a stack 
t_seq_stack* create_stack()
{
	t_seq_stack* t_stack = (t_seq_stack*)malloc(sizeof(t_seq_stack));
	if(t_stack != NULL) {
		// The initial array space 
		memset(t_stack->arr,0,sizeof(element_type));
		// Initialize the subscript 
		t_stack->top_index = EMPTY_INDEX;
	}
	return t_stack;
}

// Judge whether the stack is empty 
int is_empty(t_seq_stack *t_stack)
{
	if(t_stack != NULL) {
		return t_stack->top_index == -1 ? 1 : 0;
	}
}

// Destroy the stack 
void destroy_stack(t_seq_stack *t_stack)
{
	if(t_stack != NULL) {
		free(t_stack);
	}
}

// Empty stack 
void make_empty(t_seq_stack *t_stack)
{
	if(t_stack != NULL) {
		t_stack->top_index = -1;
	}
}

// Out of the stack 
void pop_stack(t_seq_stack *t_stack)
{
	// Whether the stack is empty must be determined when the stack is out 
	if(t_stack != NULL && (t_stack->top_index != -1)) {
		t_stack->top_index--;
	}
}


// Push 
void push_stack(t_seq_stack *t_stack,element_type value)
{
	// Before entering the stack , See if the stack space is enough 
	if(t_stack != NULL && t_stack->top_index + 1 <= MAX) {
		t_stack->arr[++t_stack->top_index] = value;
	}	
}

// Get to the top of the stack 
element_type top_stack(t_seq_stack *t_stack)
{
	if(t_stack != NULL) {
		return t_stack->arr[t_stack->top_index];// Get the data at the top of the stack 
	}
}

Then look at the test program

main.c

#include <stdio.h>
#include <stdlib.h>
#include "seqstack1.0.h"

int main()
{
	// Create a stack 
	t_seq_stack* t_stack = create_stack();
	if(t_stack != NULL) {
		printf(" Stack created successfully \n");
	}
	int num1 = 1;
	int num2 = 2;
	int num3 = 3;
	// Start stacking 
	push_stack(t_stack,&num1);
	push_stack(t_stack,&num2);
	push_stack(t_stack,&num3);
	printf(" Stack order :1\n2\n3\n");
	printf(" The number of elements in the stack ：%d\n",t_stack->top_index + 1);
	// Here is a loop operation 
	// Keep coming out of the stack , Get to the top of the stack and print 
	int i = 0;
	for(;i < 3;i++) {
		int* res = (int*)top_stack(t_stack);
		printf("%d Out of the stack \n",*res);
		pop_stack(t_stack);
	}
	return 0;
}

Running results ：

Then we make this sequence stack into a dynamic library

 

  Then move the library to the corresponding location ok