You may safely assume for the binary tree, and max-heap adts that keys are of type integer and values are of type character.

Since they said that “Binary trees must be implemented with a dynamic, linked data structure similar to what we discussed in class. You are not allowed to implement trees with arrays or to use any list, queue, vector, (binary) tree, or heap interface already available in Java. All heap operations must be either in O(1) or O(log2n). You may safely assume for the binary tree, and max-heap ADTs that keys are of type integer and values are of type character. So, the use of generics is not required.”
we have to implement the max heap using Linked list(double-linked list) without array, and any utilities
Therefore I need the max heap java project which meets these requirements

I only need help with part 2 to create 2 classes priority queues and priority queues unsorted, everything else is done.

I only need help with part 2 to create 2 classes Priority Queues and Priority Queues unsorted, everything else is done. So only create those 2 classes please. The sorting algorithms are also done thanks