Size imbalance. Let T be a binary tree and v be a node of T $.$ We say that a node v is

$-$imbalanced or v has an imbalance of if the sizes of the le$$ and right subtrees of v differ

by exactly $.$ We say that the tree T itself is $-$imbalanced if the largest imbalance at a node

of T is $.$ Given T $,$ the goal is to determine the imbalance of T $.$

Note: if v has no le$$ subtree $($or right subtree$)$ then the size of its le$$ subtree $($right subtree$)$

is $0$; otherwise, the size is a posi$$ve integer