Algorithms Searching, Sorting and Hashing Sorting

The minimum number of swaps required to build a min heap tree is ______. Assume that array of n elements is provided.

1

0

2

n/2

3

n

4

none of these

Sponsored

hivanix.in

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters