We introduce an indutively defined sequence of directed graphs and prove that the number of edges added at step k is equal to the kth Catalan number. Furthermore, we establish a bijection between the set of edges adjoined at step k and the set of planar rooted trees with k edges.