Thread: Heaps of binary tree

Hi guys, I want to ask about heap.size which it means the number of elements that satisfying/following the property of heap(assuming its max heap), lets say I have an array of

Code:

{25,12,16,13,10,8,14}

, then in this case we have a violation of the number 13 which is greater than its parent(12) so we say that the right subtree isn't satisfying the max heap property, as a result the heap.size is just 1 ((because there's just the number 25 which is satisfying that his value greater than its children)) ....I understand that but what about the left tree why we are not including it in the heap.size?! it's already following the property of max heap(16>8,16>14)

thanks!

Originally Posted by bruteforce

I don't know if anyone else agrees, but it would be better to tell this guy that you won't answer any more strange disconnected questions. He should have to post a full program.

I mean, you could of course tell him the obvious answer that the heap will contain 3 elements since 13 is the first one to break the heap property.

But forcing him to write and ask questions about actual programs will mitigate the silliness somewhat.

I know it breaks at 13 but why?! there's another right tree and its a heap!! but we we are not including it in the heap.size?! actually why at breakpoint we stop to modify the heap.size++?!