🔥 binary tree array representation → Array-based indexing (parent at i; children at 2i and 2i+1) relies on the complete shape so nodes occupy contiguous positions without gaps, making the mapping correct and space-efficient.

🌟 heap →