Leetcode 1617. Count Subtrees With Max Distance Between Cities

Given a tree (n ≤ 15), count for each d=1..n-1 how many connected node subsets (subtrees) have diameter exactly d — i.e., enumerate connected subsets and determine their maximum pairwise distance. The small n suggests bitmask enumeration with connectivity/longest-path checks.