Difficult:
I am having a hard time differentiating from all the different complexities for all the different methods. Probably because there is a lot of text between the explanations. It would be useful to see a table with: method, complexity for insterting, complexity for removing, etc.
Interesting:
If I understood correctly, a binary heap is an array sorted as if it was a tree. The kth position has children in the 2k+1 and 2k+2 positions. The priority heap is the tree form of this. There are the terms that are used interchangeably but should not be. This is the reason why I can see why they should not be used interchangeably but the book implies that there are many more.
No comments:
Post a Comment