Consider M1 and M2 be two complete binary tree which satisfy max-heap property, each of size ‘n’. What is the time complexity to combine both M1 and M2 such that combine tree will be min heap tree?
I also think answer should be 0(nlogn). @santhoshdevulapally
64.3k questions
77.9k answers
244k comments
80.0k users