2322. Minimum Score After Removals on a Tree

A tree of n nodes with values nums and edges. Remove two distinct edges, splitting the tree into 3 components. The score is (max component XOR) − (min component XOR). Minimise the score over all…