停车场管理程序用C++编写的功能比较完善的

#include "stdio.h"
#include "stdlib.h"
#define TRUE 1
#define FALSE 0
#define NULL 0
#define Stack_Size 2  /* 停车场容量 */
typedef struct
{
    int elem1[Stack_Size];
    int top;
}SeqStack;                /* 定义栈的结构体 */
typedef struct Node
{
    int num;
    struct Node *next;
}LinkQueueNode;            /* 定义链队列结点的结构体 */
typedef struct
{
    LinkQueueNode *front;
    LinkQueueNode *rear;
}LinkQueue;                /* 定义链队列的结构体*/
InitQueue(LinkQueue *Q) /* 初始化链队列函数 */
{
    Q->front=(LinkQueueNode *)malloc(sizeof(LinkQueueNode));
    if(Q->front!=NULL)
    {
        Q->rear=Q->front;
        Q->front->next=NULL;
        return(TRUE);
    }

    else return(FALSE);
}
EnterQueue(LinkQueue *Q,int x) /* 入链队列函数 */
{
    LinkQueueNode *NewNode;
    NewNode=(LinkQueueNode *)malloc(sizeof(LinkQueueNode));
    if(NewNode!=NULL)
    {
        NewNode->num=x;
        NewNode->next=NULL;
        Q->rear->next=NewNode;
        Q->rear=NewNode;
        return(TRUE);
    }
    else return(FALSE);
}
DeleteQueue(LinkQueue *Q,int *x) /* 删除链队列结点函数 */
{
    LinkQueueNode *p;
    if(Q->front==Q->rear)
    {
        return(FALSE);
    }
    p=Q->front->next;
    Q->front->next=p->next;
    if(Q->rear==p)
    {
        Q->rear=Q->front;
    }
    *x=p->num;