binary_tree/linkqueue.h

#ifndef _LINKQUEUE_H_
#define _LINKQUEUE_H_

#include "btree.h"
struct message
{
    btree_t data;
};
typedef struct message *message_t; /* data struct */

typedef struct queue_node *queue_node_t;  /* queue node struct */
struct queue_node
{
    struct message msg;
    queue_node_t next;
};

struct linkqueue
{
    queue_node_t front;
    queue_node_t rear;
};
typedef struct linkqueue *linkqueue_t; /* queue struct include ponit front and ponit rear */

linkqueue_t pkt_creat_linkqueue(void);
int pkt_empty_linkqueue(linkqueue_t q);
int pkt_put_message_linkqueue(linkqueue_t q, message_t m);
int pkt_take_message_linkqueue(linkqueue_t q, message_t m);
void ptk_show_linkqueue(linkqueue_t q);

#endif