【链表】基本线性队列

//基本线性队列
#include<iostream>

using namespace std;

typedef struct _NODE_
{

    int a;
    _NODE_* pNext;
}Node,*pNode;


class CQueue
{
private:
    pNode m_pTop;
    pNode m_pBase;
    int iNodeCount;


public:
    CQueue()
    {

        m_pTop = m_pBase = NULL;
        iNodeCount = 0;
    }

    ~CQueue()
    {

    }

    bool IsEmpty();
    void InitQueue();
    bool InQueue(int a);
    bool OutQueue(int& a);
    void DestroyQueue();
    bool GetQueueLenth(int& a);
    bool GetQueueTop(int& a);


};


bool CQueue::GetQueueLenth(int& a)
{
    a = iNodeCount;

    return true;
}
bool CQueue::GetQueueTop(int& a)
{
    a = m_pTop->a;
    
    return true;
}



bool CQueue::IsEmpty()
{
    if(iNodeCount == 0)
    {
        return true;
    }

    return false;

}
void CQueue::InitQueue()
{
    if(!IsEmpty())
    {
        DestroyQueue();
    }

    m_pTop = m_pBase = NULL;
    iNodeCount = 0;
}

bool CQueue::InQueue(int a)
{
    pNode pNodeTemp = new Node;
    
    if(pNodeTemp != NULL)
    {
        pNodeTemp->a = a;
        pNodeTemp->pNext = NULL;
    
        if(m_pTop == NULL)
        {
            m_pTop = m_pBase = pNodeTemp;
        }
        else
        {
            m_pBase->pNext = pNodeTemp;

            m_pBase = pNodeTemp;
        }

        iNodeCount++;
    
        return true;
    }
    return false;

}
    

bool CQueue::OutQueue(int& a)
{
    if(m_pTop == NULL)
    {
        return false;
    }
    else
    {
        pNode pNodeTemp = m_pTop;

        m_pTop =m_pTop->pNext;

        a = pNodeTemp->a;

        delete pNodeTemp;

        iNodeCount--;

        if(iNodeCount == 0)
        {
            m_pBase = NULL;
        }

        return true;
    }
}
void CQueue::DestroyQueue()
{
    pNode pNodeDel = m_pTop;

    while(pNodeDel != NULL)
    {

        m_pTop = m_pTop->pNext;

        delete pNodeDel;

        pNodeDel = m_pTop;

        iNodeCount--;
    }

    m_pTop = m_pBase = NULL;
    iNodeCount = 0;
}




int main()
{


    CQueue One;

    One.InitQueue();

    int i = 0;
    int iTemp = 0;
    int iLenth = 0;
    int iTop = 0;
    int a[10] = {13,25,33,15,658,3,97,60,26,16};

    printf("基本队列操作:

");
    if(One.IsEmpty())
    {
        printf("目前队列中为空
");
    }

    printf("
进队:
");
    for(i=0;i<10;i++)
    {
        One.InQueue(a[i]);    
        printf("%d ",a[i]);
    }

    if(!One.IsEmpty())
    {
        printf("

目前队列中有数据
");
    }
    printf("

");
    

    One.GetQueueLenth(iLenth);
    printf("队列长度: %d

",iLenth);

    One.GetQueueTop(iTop);
    printf("队列的头: %d

",iTop);
    
    printf("出队:
");

    for(i=0;i<10;i++)
    {
        One.OutQueue(iTemp);
        printf("%d ",iTemp);
    }
    printf("
");

    if(One.IsEmpty())
    {
        printf("
目前队列中为空
");
    }




    return 0;
}