This paper proves that two differently defined rooted binary trees are isomorphic. The first tree is one associated to a version of Farey sequences where the vertices correspond to the open intervals formed by two successive terms in the sequence. The other tree has the vertices consisting of pairs of positive integers whose adjacency is defined by a simple recursive relation. These trees appeared in a study of a generalization of a class of the permutations defined by Sós and the bijection between it and the set of the Farey intervals due to Surányi.