Pergunta de entrevista da empresa LinkedIn

Find leaves of binary tree ( https://leetcode.com/problems/find-leaves-of-binary-tree/ ) Given n balls of unequal weight and a weighing scale with two pans. Minimum comparisons are needed to find heaviest ball. ( ans - n -1) Min comparisons needed for m heaviest ball? Maintaining a max heap will give min comparison.