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?
7172 Points
4696 Points
4308 Points
4090 Points
4024 Points
3292 Points
3066 Points
3016 Points
3014 Points
2892 Points
Gatecse
^ go through