线性表

栈&队列

串

二叉树

持续更新中，尽请期待！！！

链队列

#include<bits/stdc++.h>
using namespace std;
#define QElemType int
#define Status int
//---------链队列实现--------------
typedef struct QNode{
   
    QElemType data;
    struct QNode *next;
} QNode, *QueuePtr;

typedef struct{
   
    QueuePtr front;
    QueuePtr rear;
} LinkQueue;
//----------基本操作----------------
Status InitQueue(LinkQueue &Q){
   
    Q.front = Q.rear = (QueuePtr)malloc(sizeof(QNode));
    if (!Q.front)
        exit(_OVERFLOW);
    Q.front->next = NULL;
    return 1;
}

Status DestroyQueue(LinkQueue &Q){
   
    while (Q.front){
   
        Q.rear = Q.front->next;
        free(Q.front);
        Q.front = Q.rear;
    }
    return 1;
}

Status ClearQueue(LinkQueue &Q){
   
    QueuePtr p, q;
    Q.rear = Q.front;
    p = Q.front->next;
    Q.front->next = NULL;
    while (p){
   
        q = p;
        p = p->next;
        free(q);
    }
    return 1;
}

Status QueueEmpty(LinkQueue Q){
   
    if (Q.front == Q.rear)
        return 1;
    else
        return 0;
}

int QueueLength(LinkQueue Q){
   
    int i = 0;
    QueuePtr p;
    p = Q.front;
    while (Q.rear != p){
   
        i++;
        p = p->next;
    }
    return i;
}

Status GetHead(LinkQueue Q, QElemType &e){
   
    QueuePtr p;
    if (Q.front == Q.rear)
        return 0;
    p = Q.front->next;
    e = p->data;
    return 1;
}

Status EnQueue(LinkQueue &Q, QElemType e){
   
    QueuePtr p = (QueuePtr)malloc(sizeof(QNode));
    if (!p)
        exit(_OVERFLOW);
    p->data = e;
    p->next = NULL;
    Q.rear->next = p; 
    Q.rear = p;    
    return 1;
}

Status DeQueue(LinkQueue &Q, QElemType &e){
   
    QueuePtr p;
    if (Q.front == Q.rear)
        return 0;
    p = Q.front->next;   
    e = p->data;           
    Q.front->next = p->next; 
    if (Q.rear == p)  
        Q.rear = Q.front;
    free(p);
    return 1;
}

void visit(QElemType a){
   
    cout << a << " ";
}
Status QueueTraverse(LinkQueue &Q,void (*visit)(QElemType)){
   
    QueuePtr p;
    p = Q.front->next;
    while (p){
   
        visit(p->data);
        p = p->next;
    }
    cout<<endl;
    return 1;
}