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?
5396 Points
4230 Points
3952 Points
3086 Points
2564 Points
2318 Points
2240 Points
2008 Points
1696 Points
1684 Points
Gatecse