Finded it, thanks for your help! :)

I tried but didn't find the problem. Do you have an idea?

I add this one.

while(presentPtr != NULL && type > presentPtr->userType){
prevPtr = presentPtr;
presentPtr = presentPtr->nextPtr;
}

if(type == presentPtr->userType){
while(presentPtr != NULL && p > presentPtr->pages){
prevPtr = presentPtr;
presentPtr = presentPtr->nextPtr;
}
}

I used this code.

void enqueue(char type, int p){
struct node *newPtr, *prevPtr, *presentPtr,*tempPresent;

//Allocating memory for new member
newPtr = malloc(sizeof(struct node));

//Checking allocation. If there is not room for new member in RAM then it gives an error
if(newPtr != NULL){
	newPtr->pages = p;
	newPtr->userType = type;
	newPtr->nextPtr = NULL;
	
	prevPtr = NULL;
	presentPtr = front;
	
	while(presentPtr != NULL && type > presentPtr->userType){
		prevPtr = presentPtr;
		presentPtr = presentPtr->nextPtr;
	}
	//Checking if new member is the first element of the linked list or not
	if(prevPtr == NULL){
		newPtr->nextPtr = front;
		front = newPtr;
	}
	else{
		prevPtr->nextPtr=newPtr;
		newPtr->nextPtr=presentPtr;
	}
}//If allocation fails throws a message to the user
else{
	printf("System out of memory!");
}

}

This code moves along first priority. But when I add a page check in this loop then it goes infinite loop. What will be the solution?

while(presentPtr != NULL && type > presentPtr->userType){
prevPtr = presentPtr;
presentPtr = presentPtr->nextPtr;
}

Hey, I need a C code which builds the printer job queue. However, the printer job queue is built as a two level priority queue.