struct process
{
int pid; // process id
char* file_name; // file name of the process to be run
int cpu_time; // amount of time the process needs with the cpu
int request_priority; // priority from 1-5 (higher is better)
int pr; // adjusted priority rate
};
/**************************************************  ********************/
/***** A NODE OF OUR BINARY TREE
/**************************************************  ********************/
struct node
{
process key;
// pointers to child nodes
node *left;
node *right;
};
/**************************************************  ********************/
/***** ADT PRIORITY QUEUE HEAP STRUCTURE (BINARY TREE)
/**************************************************  ********************/
class queue
{
node* root;
void insert(struct process, struct node*); // helper function for public insert()
public:
queue(); // constructor function
void insert(struct process);
void traverse(struct node*);
bool isEmpty();
};