TQueue extends the linkedlist that inserts every node in thier right priority , also note that if there is a node with a given id that is in the linked list and we delete it and then add it again with the new priority , not efficient at ALL! will change it to a binHeap that will usea hashmap to help it change priority of pre exisiting elemnets