  In this note we extend the notion of greedy bases developed by Lee, Li, and
Zelevinsky to rank two generalized cluster algebras, i.e. binomial exchange
relations are replaced by polynomial exchange relations. In the process we give
a combinatorial construction in terms of a refined notion of compatible pairs
on a maximal Dyck path.
