5 votes 5 votes 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> Algorithms algorithms greedy-algorithm + – Shashank Chavan asked Dec 15, 2015 Shashank Chavan 2.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply smsubham commented Feb 26, 2018 reply Follow Share Good read: https://xlinux.nist.gov/dads/HTML/optimalMerge.html 0 votes 0 votes Please log in or register to add a comment.
Best answer 6 votes 6 votes Caption Sandip Shaw answered Dec 16, 2015 • selected Dec 16, 2015 by Shashank Chavan Sandip Shaw comment Share Follow See all 2 Comments See all 2 2 Comments reply learner_geek commented Jul 23, 2017 i edited by learner_geek Jul 23, 2017 reply Follow Share Thanks 0 votes 0 votes sh2mohit111 commented Sep 10, 2017 reply Follow Share 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. 0 votes 0 votes Please log in or register to add a comment.
