Search results

I need to implement a priority queue using a binary search tree. I use another class for nodes; however, my project crashes when I return a pointer (specifically, when I want to set a node's left descendant to another node's right descendant - it crashes at the function that returns the right...