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?
Gatecse
Hi @
For creating automatas you can also ...