sq.cpp

采用模版函数对数据结构的线性列表和栈以及队列进行编程。

#include "List\StackQueue.h"
void main()
{
//   StackType<char> stack;
   StackLType<char> *stack;
   printf("empty stack!\n");
   InitStack(&stack);
   printf("empty stack:%d\n",Empty(&stack));
   printf("order insert a, b , c , d Elements\n");
   Push(&stack,'a');
   Push(&stack,'b');
   Push(&stack,'c');
   Push(&stack,'d');
   Display(&stack);
   printf("pop stack one time\n");
   Pop(&stack);
   printf("stack top:%c\n",GetTop(&stack));
   printf("pop stack one time\n");
   Pop(&stack);
   printf("stack top:%c\n",GetTop(&stack));
   Display(&stack);

//   QueueType<char> *qu=new QueueType<char>;
//  Qnode<char>
   QueueLType<char> *qu;

   printf("init Queue!\n");
   InitQueue(&qu);
//   InitQueue(qu);
   printf("queue empty: %d\n",Empty(qu));
   printf("order insert a, b , c , d Elements\n");
   Enter(qu,'a');
   Enter(qu,'b');
   Enter(qu,'c');
   Enter(qu,'d');
   Display(qu);
   printf("pop queue one time\n");
   Delete(qu);
   printf("first queue element:%c\n",GetHead(qu));
   printf("pop queue one time\n");
   Delete(qu);  
   Display(qu);

}