The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+3 votes
867 views
In Optimal merge pattern when do we get more than one tree(Sub trees) when creating a merge pattern?
Can you explain/draw optimal merge tree for n=7, <8,15,3,10,20,2,30>
asked in Algorithms by Loyal (3.4k points) | 867 views

1 Answer

+4 votes
Best answer
Caption

 

answered by Active (1.2k points)
selected by
Thanks
if we find that there is a two new elements are available in the array and these  both elements are less the the node (to which we are going to add new element) then we will going for the other tree.


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,834 questions
36,688 answers
90,626 comments
34,641 users