Search:

I have to turn it in. Once again, another project where nobody replied. Thanks everyone for helping me. #-o:-q

I wasn't trolling, just letting out frustration and being sarcastic in the line...

Now it seems I have my array emptying too soon. Also, still need help with the TreeNode pointers so I can find them and use them to update min and max heaps.




#ifndef MY_HEAP_H
#define...

Ok, fixed all the bugs so far but now am wondering how to go about insert since I have it as a float but also need to make it call the insert on the corresponding Node so I don't have to call two...

As I said earlier, I have an idea how to implement this code, from some stuff the book provided, but I don't know how to use the pointers to change the values when a max is deleted from a min heap. ...

I've got a more specific question. I was wondering, how do you get a pointer to both refer to a value and also to an address?

What I'd love to just do is simply, since my pointers will refer to...

I've no clue how to build them exactly. Well I kinda do, thanks to code in book. However, I'm not getting the changePriority() thing the teacher recommended. Yes, a heap is a priority queue. The...