queue.h

包括图、二叉树、链表

#ifndef QUEUE_H_
#define QUEUE_H_

#include "plane.h"

enum Error_code {success,underflow,overflow,fail};
typedef Plane Queue_entry;
const int maxqueue = 10; //  small value for testing

class Queue {
public:
   Queue();
   bool empty() const;
   Error_code serve();
   Error_code append(const Queue_entry &item);
   Error_code retrieve(Queue_entry &item) const;

protected:
   int count;
   int front, rear;
   Queue_entry entry[maxqueue];
};

#endif