用链表实现堆栈数据结构

最新推荐文章于 2024-03-06 20:04:29 发布

thomas

最新推荐文章于 2024-03-06 20:04:29 发布

阅读量761

点赞数

分类专栏：数据结构文章标签：数据结构 null access interface delete struct

本文链接：https://blog.csdn.net/nyhuachen/article/details/6419977

版权

数据结构专栏收录该内容

13 篇文章 0 订阅

订阅专栏

包含主要的功能，压栈、出栈、读数据~~~~~~~~~~~~~

/************************************************************************/ /* author : thomas E-mail: chenhua308@gmail.com */ /************************************************************************/

头文件 stack.h

#include <stdio.h> #include <malloc.h> /* **interface of stack data-structure module */ typedef int T; //you can change int into whatever data type you want typedef struct tag { T element; struct tag *link; } node; typedef node *STACK; /* ** push ** push a new value into the stack, the parameter is the value needed to push */ void push( STACK *top, T num ); /* ** pop ** just delete the top node */ void pop( STACK *top ); /* ** access ** return the top node's value */ T access( STACK top ); /* ** is_empty ** judge the state of stack ---empty? full? or …… */ int is_empty( STACK top ); /* ** destroy ** destroy the stack */ void destroy( STACK *top ); /* ** creat ** create stack */ STACK creat( T num ); /* ** print ** print the value of stack */ void print( STACK top );

源文件 stack.c

#include "stack.h" /*****************************************************************************/ STACK creat( T num ) { node *p; p = ( node * )malloc( sizeof( node ) ); p -> element = num; p -> link = NULL; return p; } void push( STACK *top, T num ) { node *p; p = ( node * )malloc( sizeof( node ) ); p -> element = num; if ( *top == NULL ) { *top = p; p -> link = NULL; } else { p -> link = *top; *top = p; } } T access( STACK top ) { return top -> element; } int is_empty( STACK top ) { return top == NULL; } void pop( STACK *top ) { node *p; p = *top; *top = (*top) -> link; free(p); } void destroy( STACK *top ) { node *temp; while ( *top != NULL ) { temp = *top; *top = (*top) -> link; free(temp); } // return top; } void print( STACK top ) { int i = 0; printf("****************************************************************/n"); if ( top == NULL ) { printf("the stack is empty! /n"); } else { while ( top != NULL ) { i++; printf("the %d number is: %d /n", i, top -> element); top = top -> link; } } }; //test the functions void main(int argc, char *argv[]) { STACK stack1 = NULL; print(stack1); stack1 = creat( 4 ); print(stack1); push( &stack1, 6 ); print(stack1); push( &stack1, 2 ); push( &stack1, 8 ); print(stack1); push( &stack1, 1 ); }