Max heap contains the element with the maximum value at the root and the smallest ones will be placed at the leaves.
As the pointer is already pointing to the leaf node, the finding operating will take O(1) time while one can argue the the removal operation may going to consume O(N) amount of time.
