queue.cpp

来自「用C实现树和图的相关算法」· C++ 代码 · 共 26 行

#include <stdio.h>
#include <malloc.h>
#include "list.h"
#include "queue.h"

queue newQueue ()
{
  queue q =(queue)malloc(sizeof (*q));
  q->l = newList ();
  return q;
}

int queueIsEmpty (queue q)
{
  return listIsEmpty (q->l);
}

void enQueue (queue q, poly x)
{
  insertListTail(q->l, x);
}

poly deQueue(queue q)
{
	return deleteListHead(q->l);
}