Bryant et al. (2014) propose a graph cleaning process and study the corresponding brush number. As their main result they show that the brush number of a tree with leaves is at least and at most . Answering one of their questions, we show that the trees with an even number of leaves and brush number can be recognized efficiently. Furthermore, we provide a simpler proof of their main result.