A binary heap is a "nearly full" binary tree — only the bottom level may not be complete:

Again only the key is shown. Each item's data would also be stored in the nodes (vertices) of the tree.