0 votes 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 asked Oct 23, 2018 edited Oct 23, 2018 by Prince Sindhiya Prince Sindhiya 407 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Prince Sindhiya commented Oct 23, 2018 reply Follow Share Can't we PERFORM AT A ROUTE FROM NODE AT LAST LEVEL ? 0 votes 0 votes eyeamgj commented Oct 23, 2018 reply Follow Share I MEAN TO SAY LAST LEVEL NODES ARE ALREADY SATISFYING THE MAX PROPERTY 0 votes 0 votes Magma commented Oct 23, 2018 reply Follow Share take some examples and then analyze.... max no of swaps = height of the tree 0 votes 0 votes Please log in or register to add a comment.