Can someone give me the best search algorithm in a max heap?In particular simply implemented as an array. I knew it has complexity of $O(N)$ but it can be done better. For example, if $A[i] < \mathrm{key}$ it's useless to search in the sub-tree with that root in the $i$th position. 
Best search in Heap Array
algorithms;data structures;search algorithms;arrays;heaps