数据结构笔记#队列

写得太偷懒，太低端。

以后的代码尽量用c++，等稍微学习下python那也是极好的。

queue.h

#ifndef QUEUE_QUEUE_H
#define QUEUE_QUEUE_H

#include <stddef.h>

typedef int DataType;

typedef struct _Node {
    DataType data;
    struct _Node *next;

    _Node(DataType d) {
        data = d;
        next = NULL;
    }
    _Node() {
        data = 0;
        next = NULL;
    }
}NODE;


//With Head Node
class QUEUE {
public:
    QUEUE();
    ~QUEUE();

    void Push(DataType);
    //return 1 == OK
    //return 0 == ERROR
    int Pop(DataType*);

private:
    NODE *head;
    NODE *tail;
};


#endif //QUEUE_QUEUE_H

queue.cpp

#include "queue.h"

QUEUE::QUEUE() {
    head = new NODE(0);
    tail = head;
}

void QUEUE::Push(DataType data) {
    NODE *tmp = new NODE(data);
    tail->next = tmp;
    tail = tmp;
    tmp = NULL;
}

int QUEUE::Pop(DataType *data) {
    if (head->next != NULL) {
        NODE *tmp = head->next;
        *data = tmp->data;
        head->next = tmp->next;
        if(head->next == NULL) {
            tail = head;
        }
        delete tmp;
        tmp = NULL;
        return 1;
    } else {
        return 0;
    }
}

QUEUE::~QUEUE() {
    NODE *tmp = head;
    while (tmp != NULL) {
        delete tmp;
        head = head->next;
        tmp = head;
    }
    tmp = NULL;
    head = NULL;
    tail = NULL;
}