0 votes 0 votes The number of possible min-heaps containing each value from {1,1,1,1,1,1,1} exactly once is _______ This is a variance of Gate 2018 question and how will we deal if all values are same? DS algorithms binary-heap data-structures + – iarnav asked Jun 24, 2018 iarnav 254 views answer comment Share Follow See 1 comment See all 1 1 comment reply Shubhgupta commented Jun 24, 2018 reply Follow Share if all values are same then there will be only one min and max heap. 4 votes 4 votes Please log in or register to add a comment.