lqueue.h

用c实现的二叉树的中序遍历的读取与存储

#ifndef LQUEUE_H
#define LQUEUE_H
#include"link5.h"
#include"binnodeptr1.h"
template <class Elem>class LQueue
{
  private:
    Link<Elem>* front;
    Link<Elem>* rear;
    int size;
  public:
    LQueue()
    {front=NULL;rear=NULL;size=0;}
    ~LQueue()
    {clear();}
    
    void clear()
    {
       while(front!=NULL)
       {
         rear=front;
         front=front->next;
         delete rear;
       }
       rear=NULL;
       size=0;
    }
    bool enqueue(const Elem& it)
    {
      if(rear==NULL)
        front=rear=new Link<Elem>(it,NULL);
      else
        {  rear->next=new Link<Elem>(it,NULL);
           rear=rear->next;
        }
      size++;
      return true;
    }
    bool dequeue(Elem& it)
    {
      if(size==0)return false;
      it=front->element;
      Link<Elem>*ltemp=front;
      front=front->next;
      delete ltemp;
      if(front==NULL)
      rear=NULL;
      size--;
      return true;
    }
    bool frontValue(Elem& it)const
    {
      if(size==0)return false;
      it=front->element;
      return true;
    }
    virtual int length() const {return size;}
};
#endif