binary search tree - from where we need to start in max-heapify algorithm? -


I do not have a requirement that we have no way of implementing Max-Hippiflier algorithms? Do we have to apply it from top to bottom or down from the top? Or do we apply those places that heap up the property? When we are going to maintain heap property in a tree.

pseudo-code is given below>> </ P> <p> Does any body Can help? </ Div> <div> </ div> <p> <div class =

I am unable to get your question of course, but I think that you doubt whether we Moving from top to bottom or up to the top
Actually we go up from the node (i) to below (lead nodes), and try to keep the heap as property we move forward.
A : An array where I left and right of the root pile, i : An array index - Take a look at this resource.
See this PDF for more information.

Hope this clears your suspicions.

Comments

Popular posts from this blog

java - ImportError: No module named py4j.java_gateway -

python - Receiving "KeyError" after decoding json result from url -

.net - Creating a new Queue Manager and Queue in Websphere MQ (using C#) -