The oriented diameter of an undirected graph G is the smallest diameter among all the diameters of oriented graphs obtained from strongly connected orientations of G. In this paper we compute the oriented diameter of the r-level sibling tree ST(r), r = 2. © 2015 Academic Publications, Ltd.