Consider M_{1} and M_{2} be two complete binary tree which satisfy max-heap property, each of size ‘n’. What is the time complexity to combine both M_{1} and M_{2} such that combine tree will be min heap tree?
5118 Points
3054 Points
2920 Points
2730 Points
2602 Points
1574 Points
1422 Points
1382 Points
1350 Points
1128 Points
Gatecse