(c++) Used a binary search tree to implement priority queue

Question

I just want any help I can get with this implementation. This is my first time posting here, I am sorry if I do something wrong in the post. As the Title says, basically I just