##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
No pointers needed
Heaps are stored as arrays, not as linked nodes.
For element at index : - Parent: - Left child: - Right child: The heap is stored exactly as written.
Index is the root, indices and are its children, and so on. This compact representation has excellent cache performance and no pointer overhead.
