0 votes 0 votes solution is provided that my doubt is can we find 3rd or 4th (and so on) smallest in 3 or 4 comparison in min heap. Harshit Bajpai asked Jan 21, 2019 Harshit Bajpai 167 views answer comment Share Follow See 1 comment See all 1 1 comment reply Shubhgupta commented Jan 21, 2019 reply Follow Share yes thats true see what is happening root element will always be 1st smallest now we need to find 2nd smallest then what are the candidate for those?(children of root one of them will be 2nd smallest so 2 comparison). if suppose 1st child of root is 2nd smallest then now you are finding 3rd smallest so what will be the candidates for this?(2nd hild of root and 2 child of 1st child node of root so 3 comparison). So go likwise. 0 votes 0 votes Please log in or register to add a comment.