Hi,
Consider a rooted tree
size(v) = number of vertices in subtree of v
Any good limit on
Unable to parse markup [type=CF_MATHJAX]
Unable to parse markup [type=CF_MATHJAX]
?like
$$$O(n \log n)$$$
$$$O(n \log \log n)$$$
$$$O(n)$$$
...
UPD :
b(v) is a son of v with the largest subtree size.
limit on
Unable to parse markup [type=CF_MATHJAX]
Unable to parse markup [type=CF_MATHJAX]
?