数据结构之__队列

老样子，代码就是一切，首先queueg.h

#ifndef queueg_h
#define queueg_h

#include <stdio.h>
#include <stdlib.h>

typedef int DataType;

typedef struct node_{
    DataType data;
    struct node_ *next;
} Node;

typedef struct list_{
    Node *head;
    Node *tail;
    Node *current;
} List;

void initList(List *);
void inQueue(List *, DataType);
void outQueue(List *);
Node *frontQueue(List *);
int getLength(List *);
void dispList(List *);

#endif

接着queueg.c

#include "queueg.h"

void initList(List *list){
    list->head = NULL;
    list->tail = NULL;
    list->current = NULL;

    return;
}

void inQueue(List *list, DataType data){
    //1、创建一个节点
    Node *node = (Node *)malloc(sizeof(Node));
    node->data = data;
    node->next = NULL;

    //2、插入节点准备
    if(list->head == NULL){
        list->head = node;
    }else{
        //node->next = list->head;
        list->tail->next = node;
    //3、插入节点
    }
    list->tail = node;

    return;
}

void outQueue(List *list){
    list->head = list->head->next;

    return;
}

Node *frontQueue(List *list){
    Node *node = (Node *)malloc(sizeof(Node));
    node = list->head;

    return node;;
}

int getLength(List *list){
    Node *node = (Node*)malloc(sizeof(Node));
    node = list->head;
    int i = 0;
    while(node != NULL){
        node = node->next;
        i++;
    }

    return i;
}

void dispList(List *list){
    Node *node = (Node *)malloc(sizeof(Node));
    node = list->head;
    int i = 0;
    while(node != NULL){
        printf("the %dth node: %d
", i + 1, node->data);
        node = node->next;
        i++;
    }
    printf("display finished
");

    return;
}

最后，测试代码testQueue.c

#include "queueg.h"

int main(int argc, char **argv)
{
    List *list = (List *)malloc(sizeof(List));
    initList(list);
    inQueue(list, 4);
    inQueue(list, 6);
    inQueue(list, 8);
    inQueue(list, 10);
    dispList(list);
    Node *tmp = frontQueue(list);
    printf("getTop result: %d
", tmp->data);
    outQueue(list);
    dispList(list);
    outQueue(list);
    dispList(list);
    printf("the list: %d
", getLength(list));

    return 0;
}

整体还是比较简单，主要是便于学生从表的角度看待栈和队列了