Programming and Data Structure Tree Complete Binary Tree

Consider a complete binary tree where the left and the right sub trees of the root are max - heaps. The lower bound for the number of operations to convert the tree to a heap is

1
Ω (log 𝑛) 
2
Ω (𝑛)
3
Ω (𝑛 log 𝑛)
4
Ω (𝑛𝑛2)

Sponsored

hivanix.in

Visit

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