Course contentsShow
← Computer Science
Lesson 583 of 2,87214. Heaps and Priority QueuesFree lesson

Visualizing Heap Structure

Practice converting between array and tree representations to understand heap structure intuitively.

Visualizing Heap Structure

You'll learn: How to fluently translate between array storage and tree visualization to better understand heap operations.

Why Both Views Matter

Heaps are stored as arrays in memory, but we understand them as trees conceptually. Being able to quickly sketch the tree from an array—or write the array from a tree—is essential for debugging, analyzing heap operations, and building intuition about how elements relate to each other.

From Array to Tree

Given an array like [10, 15, 30, 40, 50, 100, 40]:

  1. Index 0 is the root: Place 10 at the top
  2. Apply parent-child formulas: For any element at index i, its children are at 2i+1 (left) and 2i+2 (right)
  3. Build level by level: Index 0 → children at 1,2 → their children at 3,4,5,6, and so on

The tree looks like:

       10
      /  \
    15    30
   / \   /  \
  40 50 100 40

This is a valid min-heap: every parent is smaller than its children.

From Tree to Array

Reverse the process using level-order traversal (left-to-right, top-to-bottom). Read each level completely before moving down, which naturally maps to consecutive array indices.

Practice Makes Automatic

Sketch a few arrays as trees and vice versa. Notice patterns: left children are always odd indices, right children are always even. The complete binary tree shape means no "gaps" in the array until you run out of nodes.

Key Takeaway: Fluent conversion between array indices and tree visualization is crucial for understanding heap behavior—practice until you can mentally picture the tree structure from an array instantly.