  In a rooted tree, we call a vertex {\em balanced} if it is at equal distance
from all its descendant leaves. We count balanced vertices in three different
tree varieties. For decreasing binary trees, we can prove that the probability
that a vertex chosen uniformly at random from the set of all trees of a given
size is balanced is monotone decreasing.
