Now the problem is with the priority queue, it gives me an 'operator = 0 i-) so I thought that I'd create a priority queue and sort the items numerically and then remove them one by one and add to the tree, which will sort them in alphabetical order (The best I could come up with). I tried to create a treap but didn't succeed. (take A(7),C(8) and B(3) the tree should be so that the it should alphabetically represent a binary tree and numerically represent a heap)
We were asked to create a tree that has binary tree properties as well as max heap property. I'm having another problem unfortunately.
