Find successor element in heap
Suppose you have a min heap $H$, and you want to find successor one of the leaf node that its successor is maximum value, so you need to scan all leaves in tree, in addition we know that number of leaves in $H$ is $O(n)$. So you need read $O(n)$ nodes.