Random access to any key value can be done in $$O(logN)$$ in a m

Random access to any key value can be done in $$O(logN)$$ in a max-heap of $$N$$ elements. ~@[](2)

答案：FALSE