There is one downside to using vectors to represent binary heaps:

The computational costs of many operations on binary heap data structures degrade from cheap $O(logN)$ for the pointer$-$based representation of binary trees to more expensive $O(N)($as typical for operations on vectors$).$

$$ True

$$ False