Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities? for binary heap -insert: O(log n) -delete min: O(log n)   for a tree -insert: O(log n) -delete: O(log n) Then why go with array representation when both are having same values ?

• A. arrays can store trees which are complete and heaps are by it’s property are complete
• B. lists representation takes more memory hence memory efficiency is less and go with arrays
• C. array have better caching
• D. all of the mentioned