Queue Implementation

#include "bits/stdc++.h"
using namespace std;
struct node {
	int data;
	node *next;
};
class que {
	public :
	node *f, *r;
	que() {
		f = r = NULL;
	}

	void add(int let) {
		node *p;
		if(f == NULL) {
			p = new node;
			f = r = p;
			p -> data = let;
			p -> next = NULL;
		}	else {
			p = new node;
			p -> data = let;
			p -> next = NULL;
			r -> next = p;
			r = p;
		}
	}
	void del() {
		if(f == NULL) {
			cout << "queue is Empty\n";
		}	else{
			if(f == r) {
				//cout << f -> data << '\n';
				delete f;
				f = r = NULL;
			}
			else {
				node *temp = f -> next;
				delete f;
				f = temp;
			}
		}
	}
	void disp() {
		node *temp = f;
		while(temp != NULL) {
			cout << temp -> data << ' ';
			temp = temp -> next;
		}
	}
	bool e() {
		return (f == NULL);
	}
	int fro() {
		if(f ==  NULL) {
			return cout << "Queue is Empty\n",0;
		}	else {
			return f -> data;
		}

	}
};
int main(){
	que v;
	int n, x;
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> x;
		v.add(x);
	}
	v.fro();
	return 0;
}