符号平衡的算法.docVIP

#include?stdio.h?? #include?stdlib.h?? #define?ElementType?char?? ?? ?? typedef?struct?Node?*PtrToNode;?? typedef?PtrToNode?Stack;?? typedef?struct?Node?? {?? ????ElementType?Element;?? ????PtrToNode?Next;?? };?? ?? int?IsEmpty(Stack?S);?? Stack?CreateStack();?? void?DisposeStack(Stack?S);?? void?MakeEmpty(Stack?S);?? void?Push(ElementType?X,Stack?S);?? ElementType?Top(Stack?S);?? void?Pop(Stack?S);?? ?? //判断栈是否为空?? int?IsEmpty(Stack?S)?? {?? ????return?S-Next?==?NULL;?? }?? //创建链栈?? Stack?CreateStack()?? {?? ????Stack?S?=?malloc(sizeof(struct?Node));?? ????if(S?==?NULL)?? ????{?? ????????prin