Tree: , , , . Five nodes total. Start at node . Its subtrees have sizes (node ) and (rooted at ). Node 's subtree exceeds , so move to node . From node , its children and each have size , and the parent direction has size (nodes and ).
No component exceeds . Node is the centroid. You walked from root to centroid in one step. The algorithm terminated quickly because the tree is small and well-balanced.