Rank binary tree structure in total binary trees for node count n

Question

In general, if there are n nodes, there exist (2n)!/(n+1)! different tree

Is it possible to define an order function os(r,n) = rth structure of binary tree, where n = node count and r E (0, (2n)!/(n+1)!].