Array representation of heaps is a method to efficiently implement a complete binary tree structure where the heap is stored as a compact continuous block of elements. It uses index calculation to navigate parent-child relationships without explicit pointers, allowing in-place operations that optimize space and speed for priority queue applications.