实验三 链栈的设计与实现（Design and implementation of experiment three chain stack）.docVIP

实验三 链栈的设计与实现（Design and implementation of experiment three chain stack） Experiment instruction, design and implementation of three chain stack I. task analysis List of basic operations including stack stack the establishment, for length, from the top of the stack, stack, stack, to determine whether the stack for specific operation. Two. Program conception The chain storage structure of a stack is called a chain stack, which stores the stack with a linked list. Because the operation of the stack is limited, the stack and the stack are all at one end of the table, so the program is to implement a special list operation. Three. Source code / / debugging environment: Visual C++6.0 / / library files and presupposition definition #include stdlib.h #include stdio.h #define Stack_Length 6 #define OK 1 #define ERROR 0 Typedef int SElemType; Typedef struct SNode { SElemType data; Struct SNode *next; }SNode, *LinkStack; /****-------------------------------------------- *****/ / / function name: CreateTwo (LNode* head, int n) / / parameters: (afferent) LNode* head into a linked list pointer / / int n (afferent), afferent linear table number of nodes (outgoing) ElemType / / e storage delete node element value / / role: create an empty stack / / return value: no /****-------------------------------------------- *****/ Void CreateTwo (LinkStack, head, int, n) { Int i; SNode *p; / * * / define new node pointer The establishment of the lead node linear list / * * / Head= (LinkStack) malloc (sizeof (SNode)); Head-next=NULL; Printf (Please, input, the, data, for, LinkList, Nodes:, \n); For (i=n; i0; --i) { P= (SNode*) malloc (sizeof (SNode)); * application space for the new node, which creates a new node. Scanf (%d, p-data); / * * / node assignment The new node is inserted into the meter / * * / P-next=head-next; Head-next=p; } } /****-------------------------------------------- *****/ / / function name: Push (LinkStack top, SElemType E) / / parameters: (afferent) LinkStack top, the t