In a recent paper (SIAM Applied Math 2014), P Gibson relates the fundamental solution of the telegraphers equation with combinatorial properties of a binary tree. At the center of the argument, a somewhat classical relation between excursions of random walks and binary trees plays a fundamental role. In this talk, a survey of this result and some open questions will be presented.