Leetcode 3319. K-th Largest Perfect Subtree Size in Binary Tree

Find all subtree sizes that form perfect binary trees (every internal node has two children and all leaves are at the same depth) in a given binary tree, then return the k-th largest size or -1 if fewer than k such subtrees exist.