0 0 votes what i did {$2^{h+1}-1=100$} so i found h=6 so max swaps needed would be 6 please check it or tell me if i iam wrong Programming in C algorithms binary-heap + – Prince Sindhiya 999 views answer comment Share Follow Print See all 6 Comments 6 6 Comments reply Magma commented Oct 23, 2018 reply Follow flag yes answer should be 6 0 0 replyShare eyeamgj commented Oct 23, 2018 reply Follow flag I AM ALSO GETTING 6 AS MAXIMUM NUMBER OF SWAPS WE CAN PERFORM AT A ROUTE FROM NODE AT SECOND LAST LEVEL TO ROOT SO IN BETWEEN WE CAN HAE MAXIMUMM NODES EQUAL TO HEIGH SO I THINK 6 ....IS IT CORRECT?? 0 0 replyShare Prince Sindhiya commented Oct 23, 2018 reply Follow flag @eyeamgj can it be 7 0 0 replyShare Prince Sindhiya commented Oct 23, 2018 reply Follow flag Can't we PERFORM AT A ROUTE FROM NODE AT LAST LEVEL ? 0 0 replyShare eyeamgj commented Oct 23, 2018 reply Follow flag I MEAN TO SAY LAST LEVEL NODES ARE ALREADY SATISFYING THE MAX PROPERTY 0 0 replyShare Magma commented Oct 23, 2018 reply Follow flag take some examples and then analyze.... max no of swaps = height of the tree 0 0 replyShare Please log in or register to add a comment.
