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?
4386 Points
2464 Points
1850 Points
1686 Points
1340 Points
1184 Points
1112 Points
1080 Points
900 Points
732 Points
Gatecse
hi, but according to this post
Nice Post.Thanks,