Minimum Number of Operations to Sort a Binary Tree by Level

Given a binary tree with unique values, compute the minimum number of value-swaps between nodes on the same level required to make every level strictly increasing — i.e., do a level-order traversal and for each level treat the values as a permutation and sum the minimum swaps to sort them (cycle-decomposition).