數據結構鏈棧實現

如題；這是一套完整的可運行的代碼；需要讀者有一定的基礎去閱讀；

語言是用C語言實現；在C++環境中編寫；在C++中可直接運行；在C語言中需要改部分頭文件和輸出語句；

頭文件；這要是代碼的聲明部分；

# ifndef _HEAD_
# define _HEAD_

# include <iostream>
using namespace std;

typedef int DataType;

typedef struct Node
{
	DataType data;
	struct Node * next;
}SNode, * PSNode;

typedef struct
{
	PSNode top;
}LinkStack, * PLinkStack;

PLinkStack CreateLinkStack(void);
void DestroyLinkStack(PLinkStack * pS);
bool EmptyLinkStack(PLinkStack S);

bool PushLinkStack(PLinkStack S, DataType x);
bool PopLinkStack(PLinkStack S, DataType * val);
bool GetTopLinkStack(PLinkStack S, DataType * val);

# endif

實現文件；主要是代碼的實現；

# include "Head.h"

PLinkStack CreateLinkStack(void)
{
	PLinkStack S = (PLinkStack)malloc(sizeof(LinkStack));

	if (NULL != S)
	{
		S->top = NULL;

		return S;
	}
	else
	{
		cout << "Memory allocate is error! " << endl;
		system("pause");
		exit(0);
	}
}

void DestroyLinkStack(PLinkStack * pS)
{
	PLinkStack S = *pS;
	PSNode p = S->top;
	PSNode q = NULL;

	while (NULL != p)
	{
		q = p;
		p = p->next;
		free(q);
		q = NULL;
	}

	free(S);
	S = NULL;

	*pS = NULL;

	return;
}

bool EmptyLinkStack(PLinkStack S)
{
	if (NULL == S->top)
	{
		return true;
	}
	else
	{
		return false;
	}
}

bool PushLinkStack(PLinkStack S, DataType x)
{
	PSNode p = (PSNode)malloc(sizeof(SNode));

	if (NULL == p)
	{
		return false;
	}
	else
	{
		p->data = x;
		p->next = NULL;

		p->next = S->top;
		S->top = p;

		return true;
	}
}

bool PopLinkStack(PLinkStack S, DataType * val)
{
	if (EmptyLinkStack(S))
	{
		return false;
	}
	else
	{
		PSNode p = S->top;
		S->top = p->next;

		*val = p->data;

		free(p);
		p = NULL;
	}
}

bool GetTopLinkStack(PLinkStack S, DataType * val)
{
	if (EmptyLinkStack(S))
	{
		return false;
	}
	else
	{
		*val = S->top->data;

		return true;
	}
}

Main函數；

# include "Head.h"

int main(int argc, char ** argv)
{
	int val = 0;
	PLinkStack s = CreateLinkStack();
	for (int i = 0; i < 10; i++)
	{
		PushLinkStack(s, i + 1);
	}

	for (int i = 0; i < 10; i++)
	{
		PopLinkStack(s, &val);
		cout << val << " ";
	}
	cout << endl;

	cout << EmptyLinkStack(s) << endl;
	DestroyLinkStack(&s);
	if (NULL == s)
	{
		cout << "test" << endl;
	}


	system("pause");
	return 0;
}