There is a way to define an average number of branches per vertex for an arbitrary infinite locally finite tree. It equals the exponential of the Hausdorff dimension of the boundary in an appropriate metric. Its importance for probabilistic processes on a tree is shown in several ways, including random walk and percolation, where it provides points of phase transition.