The question posed by this graph problem, effectively, is: if a player begins with n seeds, what is the maximum number of turns she can take before the game can end? The answer is TREE(n).