A simple C / C++ Queue implementation (in my case for CUDA).

Node.cpp

#include "Node.h"

Node::Node(int v) {
	value = v;
	next = nullptr;
}

Node.h

#pragma once

class Node
{
public:
	Node(int v);
	int value;
	Node *next;
};

Queue.cpp

#include "Queue.h"
#include "Node.h"

Queue::Queue() {
	head = tail = nullptr;
}

bool Queue::empty() {
	return head == nullptr;
}

void Queue::enqueue(int v) {
	Node *node = new Node(v);
	if (empty()) {
		head = tail = node;
	} else if (head == tail) {
		head->next = node;
		tail = node;
	} else {
		tail->next = node;
		tail = node;
	}
}

int Queue::dequeue() {
	int v = head->value;
	if (head == tail) {
		head = tail = nullptr;
	} else {
		head = head->next;
	}

	return v;
}

Queue.h

#pragma once
#include "Node.h"

class Queue
{
private:
	Node *head;
	Node *tail;
public:
	Queue();
	bool empty();
	void enqueue(int v);
	int Queue::dequeue();
};