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?
3338 Points
2066 Points
1922 Points
1672 Points
1614 Points
1272 Points
1174 Points
1056 Points
1018 Points
758 Points
1008 Points
692 Points
632 Points
342 Points
328 Points
Gatecse