Google News
logo
Python - Interview Questions
What is heap-max and heap-min?
* In, a heap-max the key at root should be maximum among all the keys present in the heap. The same property must be recursively true for all nodes.

* In a heap-min the key at root should be minimum among all the keys present in the heap. The same property should be recursively true for all nodes.
Advertisement