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?
8796 Points
3572 Points
2914 Points
2840 Points
2550 Points
2268 Points
1990 Points
1874 Points
1820 Points
1718 Points
Gatecse